8 search results - page 1 / 2 » On constructive characterizations of (k, l)-sparse graphs |
EJC
2006
13 years 11 months ago
2006
JGT
2010
13 years 9 months ago
2010
While finite cop-win finite graphs possess a good structural characterization, none is known for infinite cop-win graphs. As evidence that such a characterization might not exis...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
The structural properties of graphs are usually characterized in terms of invariants, which are functions of graphs that do not depend on the labeling of the nodes. In this paper ...
COMBINATORICS
2006
13 years 11 months ago
2006
A graph is Y Y reducible if it can be reduced to isolated vertices by a sequence of series-parallel reductions and Y Y transformations. It is still an open problem to characterize...
FOCS
2008
IEEE
14 years 5 months ago
2008
IEEE
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...