The Strong Perfect Graph Conjecture for Planar Graphs

From MaRDI portal
Publication:5663885

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

Alan C. Tucker

Publication date: 1973

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

Full work available at URL: https://doi.org/10.4153/cjm-1973-009-3




Related Items (29)

Coloring planar perfect graphs by decompositionGeneralized perfect graphs: Characterizations and inversionPath parity and perfectionOn chordal and perfect plane near-triangulationsDuality and perfection for edges in cliquesClique-perfectness and balancedness of some graph classesGraphical properties related to minimal imperfectionFamilies of graphs complete for the strong perfect graph ConjectureColouring perfect planar graphs in parallelPolytope des independants d'un graphe série-parallèleDiscrete extremal problemsA local characterization for perfect plane near-triangulationsClasses of perfect graphsAn approach to solving \(A^{k}=J-I\)Efficient parallel and sequential algorithms for 4-coloring perfect planar graphsThe strong perfect graph conjecture for toroidal graphsA classification of certain graphs with minimal imperfection propertiesArticulation sets in linear perfect matrices. I: Forbidden configurations and star cutsetsThe strong perfect graph conjecture holds for diamonded odd cycle-free graphsSome inequalities on the chromatic number of a graphA class of facet producing graphs for vertex packing polyhedraCritical perfect graphs and perfect 3-chromatic graphsAn algorithm for colouring perfect planar graphsPartitionable graphs, circle graphs, and the Berge strong perfect graph conjectureCompleteness for intersection classesThe edge intersection graphs of paths in a treeGraph imperfection. IUnnamed ItemCircular representation problem on hypergraphs




This page was built for publication: The Strong Perfect Graph Conjecture for Planar Graphs