Restricted frame graphs and a conjecture of Scott

zbMath1331.05077arXiv1406.0338MaRDI QIDQ252837

Jérémie Chalopin, Louis Esperet, Zhentao Li, Patrice Ossona de Mendez

Publication date: 4 March 2016

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.0338

zbMATH Keywords

chromatic numberintersection graphssubdivisionschi-boundednessScott's conjecture

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (14)

Triangle‐free graphs with large chromatic number and no induced wheel ⋮ The chromatic number of {ISK4, diamond, bowtie}‐free graphs ⋮ Some remarks on graphs with no induced subdivision of \(K_4\) ⋮ Burling graphs revisited. II: Structure ⋮ Burling graphs revisited. III: Applications to \(\chi \)-boundedness ⋮ Chromatic number of ISK4-free graphs ⋮ Graphs of large chromatic number ⋮ Induced subgraphs of graphs with large chromatic number. VI. Banana trees ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Burling graphs revisited. I: New characterizations ⋮ Burling graphs, chromatic number, and orthogonal tree-decompositions ⋮ Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings ⋮ Burling graphs, chromatic number, and orthogonal tree-decompositions ⋮ Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure

Cites Work

• Induced subgraphs of graphs with large chromatic number. I. Odd holes
• Triangle-free geometric intersection graphs with large chromatic number
• Triangle-free intersection graphs of line segments with large chromatic number
• On graphs with no induced subdivision of \(K_4\)
• Induced subgraphs of graphs with large chromatic number. XI. Orientations
• Coloring triangle-free rectangle overlap graphs with \(O(\log \log n)\) colors
• Triangle-free geometric intersection graphs with no large independent sets
• Graph Theory and Probability
• Sur le coloriage des graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Restricted frame graphs and a conjecture of Scott