Coloring quasi-line graphs

DOI10.1002/JGT.20192MaRDI QIDQ3418732zbMATH OpenOpenAlexFDO

Authors Maria Chudnovsky, Alexandra Ovetsky

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

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Bounding χ in terms of ω and Δ for quasi-line graphs
• An upper bound for the chromatic number of line graphs
• Hadwiger's conjecture for quasi-line graphs
• Claw-free graphs. VII. Quasi-line graphs

Cites work

• A Theorem on Coloring the Lines of a Network

Cited in

(30)

• 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
• Claw-free graphs. VII. Quasi-line graphs
• Coloring of \((P_5, 4\)-wheel)-free graphs
• Color-line and proper color-line 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
• Hadwiger's conjecture for quasi-line graphs
• Bounding χ in terms of ω and Δ for quasi-line graphs
• Coloring fuzzy circular interval graphs
• On claw-free t-perfect graphs
• Randomly colouring graphs (a combinatorial view)
• Colouring squares of claw-free graphs
• Parameterized complexity of induced graph matching on claw-free graphs
• scientific article; zbMATH DE number 1439482 (Why is no real title available?)
• Claw-free graphs, skeletal graphs, and a stronger conjecture on , , and
• Total coloring of quasi-line graphs and inflated graphs
• Square-Free Graphs with No Six-Vertex Induced Path
• Hadwiger's conjecture for graphs with forbidden holes
• Claw-free circular-perfect graphs
• A fast algorithm to remove proper and homogeneous pairs of cliques (while preserving some graph invariants)
• Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
• Boundedness for proper conflict-free and odd colorings
• On the (1, 2⁵)-packing edge-colorings of claw-free subcubic graphs
• -boundedness and related problems on graphs without long induced paths: a survey
• Odd clique minors and chromatic bounds of {\(3K_1\), paraglider}-free graphs
• Square-free graphs with no induced fork

This page was built for publication: Coloring quasi-line graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3418732)