Pages that link to "Item:Q3304134"
From MaRDI portal
The following pages link to Colouring square-free graphs without long induced paths. (Q3304134):
Displaying 5 items.
- On colouring \((2P_2,H)\)-free and \((P_5,H)\)-free graphs (Q1707976) (← links)
- The intersection of two vertex coloring problems (Q2303434) (← links)
- Colouring square-free graphs without long induced paths (Q2323345) (← links)
- Square-Free Graphs with No Six-Vertex Induced Path (Q5232134) (← links)
- Blazing a trail via matrix multiplications: a faster algorithm for non-shortest induced paths (Q6647761) (← links)