On the chromatic number of (P_{5},windmill)-free graphs
type: Item
instance of: scholarly article
title: On the chromatic number of (P_{5},windmill)-free graphs
zbMATH Open document ID: 1420.05061
published in: Opuscula Mathematica
publication date: 2018-10-23T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C17
zbMATH DE Number: 6963032
zbMATH Keywords: vertex colouring
zbMATH Keywords: perfect graphs
zbMATH Keywords: \(\chi\)-binding function
zbMATH Keywords: forbidden induced subgraph
author: Ingo Schiermeyer
MaRDI profile type: Publication
cites work: Dominating cliques in \(P_ 5\)-free graphs
cites work: Perfect coloring and linearly χ-boundP6-free graphs
cites work: The Erdős-Hajnal conjecture. A survey
cites work: The strong perfect graph theorem
cites work: Graph Theory and Probability
cites work: The chromatic number of \(\{P_5,K_4\}\)-free graphs
cites work: On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
cites work: Q5749319
cites work: Chromatic number of \(P_5\)-free graphs: Reed's conjecture
cites work: A bound on the chromatic number of graphs without certain induced subgraphs
DOI: 10.7494/OPMATH.2017.37.4.609
Recommended article: Q5284095
Recommended article: Chromatic number and subtrees of graphs
Recommended article: Odd induced subgraphs in graphs with treewidth at most two
Recommended article: Induced subgraphs of graphs with large chromatic number. VI. Banana trees
Recommended article: Radius Three Trees in Graphs with Large Chromatic Number
Recommended article: Induced subgraphs of graphs with large chromatic number. VII: Gyárfás' complementation conjecture
Recommended article: Radius two trees specify χ‐bounded classes
Recommended article: Bounded vertex coloring of trees
Recommended article: χ‐bounded families of oriented graphs
Recommended article: Chi-boundedness of graph classes excluding wheel vertex-minors
description: scientific article; zbMATH DE number 6963032