13 search results - page 3 / 3 » The branchwidth of graphs and their cycle matroids |
DM
2008
13 years 7 months ago
2008
Using results by McKee and Woodall on binary matroids, we prove that the set of postman sets has odd cardinality, generalizing a result by Toida on the cardinality of cycles in Eu...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
Let G = (V, E) be an undirected graph, and let B ⊆ V × V be a collection of vertex pairs. We give an incremental polynomial time algorithm to enumerate all minimal edge sets X â...
LMCS
2006
13 years 7 months ago
2006
This article establishes that the split decomposition of graphs introduced by Cunnigham, is definable in Monadic Second-Order Logic.This result is actually an instance of a more ge...