Pages that link to "Item:Q2631086"

The following pages link to Vizing bound for the chromatic number on some graph classes (Q2631086):

Displaying 16 items.

• Chromatic bounds for the subclasses of \(pK_2\)-free graphs (Q831732) (← links)
• Colouring of \((P_3 \cup P_2)\)-free graphs (Q1706425) (← links)
• Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849) (← links)
• Chromatic bounds for some classes of \(2 K_2\)-free graphs (Q1783621) (← links)
• Locating-dominating sets: from graphs to oriented graphs (Q2092344) (← links)
• Classes of graphs with no long cycle as a vertex-minor are polynomially \(\chi\)-bounded (Q2284734) (← links)
• On the chromatic number of (\(P_6\), diamond)-free graphs (Q2413634) (← links)
• The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor (Q2662350) (← links)
• Colouring graphs with no induced six-vertex path or diamond (Q5925590) (← links)
• Colouring graphs with no induced six-vertex path or diamond (Q5972261) (← links)
• THE CHROMATIC NUMBER OF -FREE GRAPHS (Q6046762) (← links)
• On graphs with no induced five‐vertex path or paraglider (Q6055942) (← links)
• An optimal χ‐bound for (P6, diamond)‐free graphs (Q6080859) (← links)
• On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques (Q6084676) (← links)
• Bounds for the chromatic number of some \(pK_2\)-free graphs (Q6103479) (← links)
• On the chromatic number of (P5,dart)-free graphs (Q6132236) (← links)