A BOUND FOR THE CHROMATIC NUMBER OF (, GEM)-FREE GRAPHS

DOI10.1017/S0004972719000352zbMath1419.05067OpenAlexW2930774002MaRDI QIDQ5232874

Shenwei Huang, Owen Merkel, Kathie Cameron

Publication date: 13 September 2019

Published in: Bulletin of the Australian Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0004972719000352

zbMATH Keywords

graph colouringhereditary classeschi-bound

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

Colouring graphs with no induced six-vertex path or diamond ⋮ On the chromatic number of some \(P_5\)-free graphs ⋮ Divisibility and coloring of some \(P_5\)-free graphs ⋮ Coloring graphs with no induced five‐vertex path or gem ⋮ Some results on \(k\)-critical \(P_5\)-free graphs ⋮ A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs ⋮ Colouring graphs with no induced six-vertex path or diamond

Cites Work

• Unnamed Item
• Coloring the hypergraph of maximal cliques of a graph with no long path
• Linearly \(\chi\)-bounding \((P_6,C_4)\)-free graphs
• On the structure of (\(P_{5}\),\,gem)-free graphs
• Normal hypergraphs and the perfect graph conjecture
• On a property of the class of n-colorable graphs
• Perfect coloring and linearly χ-boundP6-free graphs
• Square-Free Graphs with No Six-Vertex Induced Path
• Perfect divisibility and 2‐divisibility

This page was built for publication: A BOUND FOR THE CHROMATIC NUMBER OF (, GEM)-FREE GRAPHS