Pages that link to "Item:Q2182090"
From MaRDI portal
The following pages link to Colouring \((P_r + P_s)\)-free graphs (Q2182090):
Displaying 15 items.
- The vertex colourability problem for \(\{\text{claw}, \text{butterfly}\}\)-free graphs is polynomial-time solvable (Q828645) (← links)
- Colouring of \((P_3 \cup P_2)\)-free graphs (Q1706425) (← links)
- 4-coloring \(H\)-free graphs when \(H\) is small (Q1759872) (← links)
- Injective colouring for H-free graphs (Q2117071) (← links)
- Colouring generalized claw-free graphs and graphs of large girth: bounding the diameter (Q2167905) (← links)
- List 3-coloring graphs with no induced \(P_6 + rP_3\) (Q2223697) (← links)
- List \(k\)-colouring \(P_t\)-free graphs: a mim-width perspective (Q2234796) (← links)
- 3-colouring \(P_t\)-free graphs without short odd cycles (Q2696271) (← links)
- On algorithmic applications of sim-width and mim-width of \((H_1,H_2)\)-free graphs (Q2697441) (← links)
- Coloring (gem, co‐gem)‐free graphs (Q4646937) (← links)
- Colouring graphs of bounded diameter in the absence of small cycles (Q5918661) (← 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)
- Making an H $H$‐free graph k $k$‐colorable (Q6093148) (← links)
- A complete complexity dichotomy of the edge-coloring problem for all sets of 8-edge forbidden subgraphs (Q6644082) (← links)
