Pages that link to "Item:Q2413634"
From MaRDI portal
The following pages link to On the chromatic number of (\(P_6\), diamond)-free graphs (Q2413634):
Displaying 8 items.
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849) (← links)
- Strong cliques in diamond-free graphs (Q5919069) (← 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)
- An optimal χ‐bound for (P6, diamond)‐free graphs (Q6080859) (← links)
- Improved bounds on the chromatic number of (\(P_5\), flag)-free graphs (Q6098088) (← links)
- Linear <i>χ</i> -binding functions for some classes of ( <i>P</i> <sub>3</sub> ∪ <i>P</i> <sub>2</sub> )-free graphs (Q6643347) (← links)
