The world of hereditary graph classes viewed through Truemper configurations
From MaRDI portal
Publication:2875860
DOI10.1017/CBO9781139506748.008zbMath1301.05279MaRDI QIDQ2875860
Publication date: 12 August 2014
Published in: Surveys in Combinatorics 2013 (Search for Journal in Brave)
Combinatorial aspects of matroids and geometric lattices (05B35) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (12)
The (theta, wheel)-free graphs. I: Only-prism and only-pyramid graphs ⋮ The (theta, wheel)-free graphs. II: Structure theorem ⋮ Clique cutsets beyond chordal graphs ⋮ Complexity-separating graph classes for vertex, edge and total colouring ⋮ Triangle‐free graphs with large chromatic number and no induced wheel ⋮ Coloring rings ⋮ On the structure and clique‐width of (4K1,C4,C6,C7)‐free graphs ⋮ (Theta, triangle)‐free and (even hole, K4)‐free graphs—Part 1: Layered wheels ⋮ The structure of (theta, pyramid, 1‐wheel, 3‐wheel)‐free graphs ⋮ Vertex elimination orderings for hereditary graph classes ⋮ Implosive graphs: Square-free monomials on symbolic Rees algebras ⋮ Linear Balanceable and Subcubic Balanceable Graphs*
This page was built for publication: The world of hereditary graph classes viewed through Truemper configurations
