328 search results - page 23 / 66 » Homomorphism bounded classes of graphs |
105
Voted
CCCG
2004
15 years 3 months ago
2004
We propose a definition of locality for properties of geometric graphs. We measure the local density of graphs using region-counting distances [8] between pairs of vertices, and w...
88
Voted
LATIN
2010
Springer
15 years 8 months ago
2010
Springer
In this paper, we consider the problem of representing graphs by polygons whose sides touch. We show that at least six sides per polygon are necessary by constructing a class of pl...
132
Voted
SPAA
2004
ACM
15 years 7 months ago
2004
ACM
Given a general graph G, a fundamental problem is to find a spanning tree H that best approximates G by some measure. Often this measure is some combination of the congestion and...
129
click to vote
COLOGNETWENTE
2007
15 years 3 months ago
2007
We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth. Graphs of bounded gr...
102
Voted
COMBINATORICS
2000
15 years 1 months ago
2000
The set R of relevant cycles of a graph G is the union of its minimum cycle bases. We introduce a partition of R such that each cycle in a class W can be expressed as a sum of oth...