Perfect and locally perfect colorings

DOI10.1002/JGT.3190200413MaRDI QIDQ4857449zbMATH OpenOpenAlexFDO

Authors Irena Rusu

Publication date 30 May 1996

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

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

zbMATH Keywords

coloring perfect graphspartity graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• An algorithm for coloring some perfect graphs
• Four classes of perfectly orderable graphs
• Locally perfect graphs
• An O(N2) algorithm for coloring perfect planar graphs
• Perfectly colorable graphs

Cites work

• A new property of critical imperfect graphs and some consequences

Cited in

(3)

• Locally perfect graphs
• Sequential colorings and perfect graphs
• scientific article; zbMATH DE number 1189243 (Why is no real title available?)

This page was built for publication: Perfect and locally perfect colorings

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