The strong perfect graph conjecture for toroidal graphs

DOI10.1016/0095-8956(81)90092-7zbMath0475.05031OpenAlexW2069051021MaRDI QIDQ1159682

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 graphtoroidal graphcritical 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)

Related Items

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

Cites Work

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