Coloring perfect degenerate graphs

DOI10.1016/S0012-365X(96)00009-XMaRDI QIDQ1356545zbMATH OpenFDO

Authors Frédéric Maffray, Hacène Ait Haddadene

Publication date 15 September 1997

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/S0012-365X(96)00009-X

zbMATH Keywords

coloringcombinatorial algorithmdegenerate Berge graphdegenerate perfect graphpolynomial time

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Total colorings of degenerate graphs
• Coloring square-free Berge graphs
• Coloring planar perfect graphs by decomposition
• scientific article; zbMATH DE number 1754616
• Colouring perfect graphs with bounded clique number

Cites work

• A reduction procedure for coloring perfect \(K_ 4\)-free graphs
• scientific article; zbMATH DE number 3882470 (Why is no real title available?)
• scientific article; zbMATH DE number 3168327 (Why is no real title available?)
• scientific article; zbMATH DE number 3522018 (Why is no real title available?)
• scientific article; zbMATH DE number 3632548 (Why is no real title available?)
• On rigid circuit graphs
• Split-neighbourhood graphs and the strong perfect graph conjecture
• The splittance of a graph
• Topics on perfect graphs

Cited in

(9)

• Coloring planar perfect graphs by decomposition
• On weakly diamond-free Berge graphs
• On Tucker vertices of graphs
• Coloring square-free Berge graphs
• On the quasi-locally paw-free graphs
• Perfect colorings of the prism graph
• Classes of perfect graphs
• Total colorings of degenerate graphs
• scientific article; zbMATH DE number 1033812 (Why is no real title available?)

This page was built for publication: Coloring perfect degenerate graphs

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