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

DOI10.7494/OPMATH.2017.37.4.609zbMATH Open1420.05061MaRDI QIDQ4690990FDOQ4690990

Authors: Ingo Schiermeyer 

Publication date: 23 October 2018

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

Recommendations

• scientific article; zbMATH DE number 975418
• Chromatic number and subtrees of graphs
• Odd induced subgraphs in graphs with treewidth at most two
• Induced subgraphs of graphs with large chromatic number. VI. Banana trees
• Radius Three Trees in Graphs with Large Chromatic Number
• Induced subgraphs of graphs with large chromatic number. VII: Gyárfás' complementation conjecture
• Radius two trees specify χ‐bounded classes
• Bounded vertex coloring of trees
• χ‐bounded families of oriented graphs
• Chi-boundedness of graph classes excluding wheel vertex-minors

zbMATH Keywords

perfect graphsforbidden induced subgraphvertex colouring\(\chi\)-binding function

Mathematics Subject Classification ID

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

Cites Work

• Graph Theory and Probability
• Title not available (Why is that?)
• The Erdős-Hajnal conjecture. A survey
• The strong perfect graph theorem
• 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
• Chromatic number of \(P_5\)-free graphs: Reed's conjecture
• Perfect coloring and linearly χ-boundP6-free graphs
• A bound on the chromatic number of graphs without certain induced subgraphs

Cited In (17)

• Distance and eccentricity based invariants of windmill graph
• On the chromatic number of some \(P_5\)-free graphs
• Coloring of \((P_5, 4\)-wheel)-free graphs
• On chromatic number of graphs without certain induced subgraphs.
• On the chromatic number of \(2 K_2\)-free graphs
• Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
• Polynomial bounds for chromatic number II: Excluding a star‐forest
• The chromatic number of \(\{P_5,K_4\}\)-free graphs
• Polynomial bounds for chromatic number VII. Disjoint holes
• On the chromatic number of \((P_{5},K_{2,t})\)-free graphs
• On the chromatic number of pentagon-free graphs of large minimum degree
• Bounds for the chromatic number of some \(pK_2\)-free graphs
• On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques
• 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
• On the chromatic number of (P5,dart)-free graphs
• Coloring of a superclass of \(2K_2\)-free graphs

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

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