A bound for the chromatic number of (P₅, gem)-free graphs

DOI10.1017/S0004972719000352MaRDI QIDQ5232874zbMATH OpenOpenAlexFDO

Authors Kathie Cameron, Shenwei Huang, Owen Merkel

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

chi-boundgraph colouringhereditary classes

Mathematics Subject Classification ID

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

Recommendations

• Coloring (gem, co‐gem)‐free graphs
• On the chromatic number of some \(P_5\)-free graphs
• On the chromatic number of \((P_{5},K_{2,t})\)-free graphs
• Coloring of \((P_5, 4\)-wheel)-free graphs
• A tight linear bound to the chromatic number of (P₅, K₁ +(K₁ K₃))-free graphs

Cites work

• Coloring the hypergraph of maximal cliques of a graph with no long path
• scientific article; zbMATH DE number 4183452 (Why is no real title available?)
• Linearly \(\chi\)-bounding \((P_6,C_4)\)-free graphs
• Normal hypergraphs and the perfect graph conjecture
• On a property of the class of n-colorable graphs
• On the structure of (\(P_{5}\),\,gem)-free graphs
• Perfect coloring and linearly χ-boundP6-free graphs
• Perfect divisibility and 2‐divisibility
• Square-Free Graphs with No Six-Vertex Induced Path

Cited in

(20)

• On the structure of (\(P_{5}\),\,gem)-free graphs
• Chordal co-gem-free and (\(P_{5}\),\,gem)-free graphs have bounded clique-width
• Coloring of \((P_5, 4\)-wheel)-free graphs
• On the chromatic number of some \(P_5\)-free graphs
• A tight linear bound to the chromatic number of (P₅, K₁ +(K₁ K₃))-free graphs
• Perfect coloring and linearly χ-boundP6-free graphs
• Colouring graphs with no induced six-vertex path or diamond
• Colouring graphs with no induced six-vertex path or diamond
• Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors
• THE CHROMATIC NUMBER OF -FREE GRAPHS
• On graphs with no induced five‐vertex path or paraglider
• Polynomial bounds for chromatic number. IV: A near-polynomial bound for excluding the five-vertex path
• On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques
• Improved bounds on the chromatic number of (\(P_5\), flag)-free graphs
• Divisibility and coloring of some \(P_5\)-free graphs
• On the chromatic number of (P5,dart)-free graphs
• Coloring graphs with no induced five‐vertex path or gem
• Some results on \(k\)-critical \(P_5\)-free graphs
• The chromatic number of (\(P_5\), HVN)-free graphs
• -boundedness and related problems on graphs without long induced paths: a survey

This page was built for publication: A bound for the chromatic number of \((P_5, \text{gem})\)-free graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5232874)