Amalgams and χ-Boundedness

DOI10.1002/jgt.22012zbMath1354.05053OpenAlexW2186092546MaRDI QIDQ2958199

Irena Penev

Publication date: 1 February 2017

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://orbit.dtu.dk/en/publications/1fc0bd59-8725-4da4-885d-4ba3491e0259

zbMATH Keywords

housegraph decompositionsamalgamhereditary classes\(\chi\)-bounded classes

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Triangle-free intersection graphs of line segments with large chromatic number
• Classes of graphs with small rank decompositions are \(\chi \)-bounded
• On graphs with no induced subdivision of \(K_4\)
• Substitution and \(\chi\)-boundedness
• Induced subdivisions in \(K_{s,s}\)-free graphs of large average degree
• On rigid circuit graphs
• The strong perfect graph theorem
• Bull-free Berge graphs are perfect
• Star-cutsets and perfect graphs
• Induced cycles and chromatic number
• Compositions for perfect graphs
• Normal hypergraphs and the perfect graph conjecture
• Excluding Induced Subdivisions of the Bull and Related Graphs
• Subgraphs of large connectivity and chromatic number in graphs of large chromatic number
• Even and odd holes in cap-free graphs
• Sur le coloriage des graphs