Pages that link to "Item:Q2323345"

The following pages link to Colouring square-free graphs without long induced paths (Q2323345):

Displaying 3 items.

• The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable (Q828645) (← links)
• The computational complexity of weighted vertex coloring for \(\{P_5,K_{2,3},K^+_{2,3}\}\)-free graphs (Q1996748) (← links)
• Clique‐width: Harnessing the power of atoms (Q6062871) (← links)