250 search results - page 18 / 50 » Constructing a Class of Symmetric Graphs |
DAM
2010
13 years 8 months ago
2010
We study P6-free graphs, i.e., graphs that do not contain an induced path on six vertices. Our main result is a new characterization of this graph class: a graph G is P6-free if an...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
Once the set of finite graphs is equipped with an algebra structure (arising from the definition of operations that generalize the concatenation of words), one can define the noti...
LATIN
2010
Springer
14 years 3 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...
CCCG
2009
13 years 9 months ago
2009
We investigate the relationship between geometric thickness and the thickness, outerthickness, and arboricity of graphs. In particular, we prove that all graphs with arboricity tw...
FOCS
2009
IEEE
14 years 3 months ago
2009
IEEE
—We introduce a new tool for approximation and testing algorithms called partitioning oracles. We develop methods for constructing them for any class of bounded-degree graphs wit...