Sciweavers

Share
JCT
2010
70views more  JCT 2010»
8 years 2 months ago
Graphs with bounded tree-width and large odd-girth are almost bipartite
We prove that for every k and every ε > 0, there exists g such that every graph with tree-width at most k and odd-girth at least g has circular chromatic number at most 2 + ε...
Alexandr V. Kostochka, Daniel Král', Jean-S...
JCT
2007
95views more  JCT 2007»
8 years 4 months ago
Directed tree-width examples
In [1] Johnson, Robertson, Seymour and Thomas define the notion of directed tree-width dtw(D) of a directed graph D. They ask whether dtw(D) ≥ k − 1 implies that D has a have...
Isolde Adler
EJC
2006
8 years 4 months ago
Matroid tree-width
Abstract. We show that the tree-width of a graph can be defined without reference to graph vertices, and hence the notion of tree-width can be naturally extended to matroids. (This...
Petr Hlinený, Geoff Whittle
EJC
2010
8 years 4 months ago
Rank-width and tree-width of H-minor-free graphs
We prove that for any fixed r 2, the tree-width of graphs not containing Kr as a topological minor (resp. as a subgraph) is bounded by a linear (resp. polynomial) function of the...
Fedor V. Fomin, Sang-il Oum, Dimitrios M. Thilikos
CORR
2008
Springer
96views Education» more  CORR 2008»
8 years 4 months ago
Tree-width of hypergraphs and surface duality
In Graph Minors III, Robertson and Seymour write:"It seems that the tree-width of a planar graph and the tree-width of its geometric dual are approximately equal -- indeed, w...
Frédéric Mazoit
ICDT
2001
ACM
131views Database» more  ICDT 2001»
8 years 8 months ago
Query Evaluation via Tree-Decompositions
A number of efficient methods for evaluating first-order and monadic-second order queries on finite relational structures are based on tree-decompositions of structures or quer...
Jörg Flum, Markus Frick, Martin Grohe
MFCS
2005
Springer
8 years 9 months ago
D-Width: A More Natural Measure for Directed Tree Width
Due to extensive research on tree-width for undirected graphs and due to its many applications in various fields it has been a natural desire for many years to generalize the idea...
Mohammad Ali Safari
CSL
2007
Springer
8 years 10 months ago
Clique-Width and Parity Games
The question of the exact complexity of solving parity games is one of the major open problems in system verification, as it is equivalent to the problem of model-checking the mod...
Jan Obdrzálek
books