On the chromatic number of (P_{5},windmill)-free graphs

DOI10.7494/OpMath.2017.37.4.609zbMath1420.05061MaRDI QIDQ4690990

Ingo Schiermeyer

Publication date: 23 October 2018

Published in: Opuscula Mathematica (Search for Journal in Brave)

zbMATH Keywords

perfect graphsvertex colouringforbidden induced subgraph\(\chi\)-binding function

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17)

Related Items (12)

Distance and eccentricity based invariants of windmill graph ⋮ On the chromatic number of \(2 K_2\)-free graphs ⋮ On the chromatic number of some \(P_5\)-free graphs ⋮ Polynomial bounds for chromatic number II: Excluding a star‐forest ⋮ Polynomial bounds for chromatic number VII. Disjoint holes ⋮ On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques ⋮ Bounds for the chromatic number of some \(pK_2\)-free graphs ⋮ Coloring of a superclass of \(2K_2\)-free graphs ⋮ Polynomial bounds for chromatic number VI. Adding a four-vertex path ⋮ 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 ⋮ Coloring of \((P_5, 4\)-wheel)-free graphs

Cites Work

• Unnamed Item
• Chromatic number of \(P_5\)-free graphs: Reed's conjecture
• The strong perfect graph theorem
• A bound on the chromatic number of graphs without certain induced subgraphs
• Dominating cliques in \(P_ 5\)-free graphs
• On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
• The chromatic number of \(\{P_5,K_4\}\)-free graphs
• The Erdös-Hajnal Conjecture-A Survey
• Graph Theory and Probability
• Perfect coloring and linearly χ-boundP6-free graphs

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