The Strong Perfect Graph Conjecture for Planar Graphs

DOI10.4153/CJM-1973-009-3zbMath0251.05102WikidataQ123359872 ScholiaQ123359872MaRDI QIDQ5663885

Alan C. Tucker

Publication date: 1973

Published in: Canadian Journal of Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

05C10: Planar graphs; geometric and topological aspects of graph theory

05C15: Coloring of graphs and hypergraphs

Related Items

Duality and perfection for edges in cliques, The edge intersection graphs of paths in a tree, Circular representation problem on hypergraphs, Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs, Coloring planar perfect graphs by decomposition, Graphical properties related to minimal imperfection, Polytope des independants d'un graphe série-parallèle, Discrete extremal problems, The strong perfect graph conjecture for toroidal graphs, A classification of certain graphs with minimal imperfection properties, Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets, The strong perfect graph conjecture holds for diamonded odd cycle-free graphs, Some inequalities on the chromatic number of a graph, A class of facet producing graphs for vertex packing polyhedra, Critical perfect graphs and perfect 3-chromatic graphs, Path parity and perfection, An approach to solving \(A^{k}=J-I\), Completeness for intersection classes, An algorithm for colouring perfect planar graphs, Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture, Graph imperfection. I, Generalized perfect graphs: Characterizations and inversion, Classes of perfect graphs, Families of graphs complete for the strong perfect graph Conjecture