Pages that link to "Item:Q2323345"
From MaRDI portal
The following pages link to Colouring square-free graphs without long induced paths (Q2323345):
Displaying 9 items.
- The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable (Q828645) (← links)
- Coloring square-free Berge graphs (Q1719576) (← links)
- The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs (Q1996748) (← links)
- Colouring square-free graphs without long induced paths. (Q3304134) (← links)
- Colouring Graphs with Prescribed Induced Cycle Lengths (Q4542873) (← links)
- Square-Free Graphs with No Six-Vertex Induced Path (Q5232134) (← links)
- Approximately coloring graphs without long induced paths (Q5915792) (← links)
- Colouring graphs with no induced six-vertex path or diamond (Q5972261) (← links)
- Clique‐width: Harnessing the power of atoms (Q6062871) (← links)
