The strong perfect graph conjecture for toroidal graphs

DOI10.1016/0095-8956(81)90092-7MaRDI QIDQ1159682zbMATH OpenOpenAlexFDO

Authors Charles M. Grinstead

Publication date 1981

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0095-8956(81)90092-7

zbMATH Keywords

perfect graphcritical graphtoroidal graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cites work

• A characterization of perfect graphs
• Construction and enumeration of regular maps on the torus
• Critical perfect graphs and perfect 3-chromatic graphs
• Perfect zero–one matrices
• The Strong Perfect Graph Conjecture for Planar Graphs

Cited in

(5)

• Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture
• The edge intersection graphs of paths in a tree
• An algorithm for colouring perfect planar graphs
• A classification of certain graphs with minimal imperfection properties
• Classes of perfect graphs

This page was built for publication: The strong perfect graph conjecture for toroidal graphs

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