On the chromatic number of \((P_{5},K_{2,t})\)-free graphs

DOI10.1016/j.endm.2016.10.032zbMath1356.05046OpenAlexW2555019669MaRDI QIDQ510963

Christoph Brause, Trung Duy Doan, Ingo Schiermeyer

Publication date: 14 February 2017

Full work available at URL: https://doi.org/10.1016/j.endm.2016.10.032

zbMATH Keywords

chromatic number\(P_5\)-free graphs\(\chi\)-binding function

Mathematics Subject Classification ID

Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

On the chromatic number of some \(P_5\)-free graphs ⋮ On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques ⋮ A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs ⋮ Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey

Cites Work

• Unnamed Item
• Chromatic number of \(P_5\)-free graphs: Reed's conjecture
• The strong perfect graph theorem
• Dominating cliques in \(P_ 5\)-free graphs
• On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
• Graph Theory and Probability
• Perfect coloring and linearly χ-boundP6-free graphs

This page was built for publication: On the chromatic number of \((P_{5},K_{2,t})\)-free graphs