The following pages link to Coloring quasi-line graphs (Q3418732):
Displaying 23 items.
- Coloring fuzzy circular interval graphs (Q412282) (← links)
- On claw-free \(t\)-perfect graphs (Q431021) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Parameterized complexity of induced graph matching on claw-free graphs (Q487013) (← links)
- A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants) (Q635519) (← links)
- Square-free graphs with no induced fork (Q831350) (← links)
- Characterizing and bounding the imperfection ratio for some classes of graphs (Q1016110) (← links)
- The Erdős-Lovász tihany conjecture for quasi-line graphs (Q1043565) (← links)
- Colouring squares of claw-free graphs (Q1689990) (← links)
- Coloring of \((P_5, 4\)-wheel)-free graphs (Q2113346) (← links)
- Erdős-Lovász Tihany conjecture for graphs with forbidden holes (Q2312803) (← links)
- Finding a smallest odd hole in a claw-free graph using global structure (Q2444540) (← links)
- Characterising claw-free t-perfect graphs (Q2851509) (← links)
- Coloring Fuzzy Circular Interval Graphs (Q2851514) (← links)
- Domination When the Stars Are Out (Q3012826) (← links)
- Asymptotics of the chromatic number for quasi-line graphs (Q3503489) (← links)
- Hadwiger's conjecture for quasi-line graphs (Q3528157) (← links)
- Bounding χ in terms of ω and Δ for quasi-line graphs (Q3605150) (← links)
- Colouring Squares of Claw-free Graphs (Q4625179) (← links)
- Claw‐Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ (Q4982280) (← links)
- Square-Free Graphs with No Six-Vertex Induced Path (Q5232134) (← links)
- Hadwiger's Conjecture for Graphs with Forbidden Holes (Q5348213) (← links)
- Claw‐free circular‐perfect graphs (Q5893933) (← links)
