Pages that link to "Item:Q5251642"
From MaRDI portal
The following pages link to Narrowing the Complexity Gap for Colouring (C s ,P t )-Free Graphs (Q5251642):
Displayed 6 items.
- Three-coloring and list three-coloring of graphs without induced paths on seven vertices (Q1786047) (← links)
- Colouring square-free graphs without long induced paths (Q2323345) (← links)
- Clique-Width of Graph Classes Defined by Two Forbidden Induced Subgraphs (Q2947018) (← links)
- Approximately coloring graphs without long induced paths (Q5915792) (← links)
- On 3-coloring of \((2P_4,C_5)\)-free graphs (Q5918691) (← links)
- On 3-coloring of \((2P_4,C_5)\)-free graphs (Q5925555) (← links)