Coloring quasi-line graphs

DOI10.1002/jgt.20192zbMath1110.05031MaRDI QIDQ3418732

Alexandra Ovetsky, Maria Chudnovsky

Publication date: 24 January 2007

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20192

zbMATH Keywords

claw-free graphs

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

Related Items

Colouring Squares of Claw-free Graphs, Claw‐Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ, Square-Free Graphs with No Six-Vertex Induced Path, Hadwiger's Conjecture for Graphs with Forbidden Holes, Claw‐free circular‐perfect graphs, Coloring fuzzy circular interval graphs, On claw-free \(t\)-perfect graphs, Randomly colouring graphs (a combinatorial view), Parameterized complexity of induced graph matching on claw-free graphs, A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants), Square-free graphs with no induced fork, Characterizing and bounding the imperfection ratio for some classes of graphs, The Erdős-Lovász tihany conjecture for quasi-line graphs, Colouring squares of claw-free graphs, Coloring of \((P_5, 4\)-wheel)-free graphs, Erdős-Lovász Tihany conjecture for graphs with forbidden holes, Finding a smallest odd hole in a claw-free graph using global structure, Characterising claw-free t-perfect graphs, Coloring Fuzzy Circular Interval Graphs, Domination When the Stars Are Out, Asymptotics of the chromatic number for quasi-line graphs, Hadwiger's conjecture for quasi-line graphs, Bounding χ in terms of ω and Δ for quasi-line graphs

Cites Work

• A Theorem on Coloring the Lines of a Network