The Strong Perfect Graph Conjecture for Planar Graphs
From MaRDI portal
Cited in
(30)- Graphical properties related to minimal imperfection
- Partitionable graphs, circle graphs, and the Berge strong perfect graph conjecture
- Path parity and perfection
- An approach to solving \(A^{k}=J-I\)
- Articulation sets in linear perfect matrices. I: Forbidden configurations and star cutsets
- The edge intersection graphs of paths in a tree
- An algorithm for colouring perfect planar graphs
- A class of facet producing graphs for vertex packing polyhedra
- Graph imperfection. I
- A local characterization for perfect plane near-triangulations
- Critical perfect graphs and perfect 3-chromatic graphs
- Generalized perfect graphs: Characterizations and inversion
- Duality and perfection for edges in cliques
- Discrete extremal problems
- Families of graphs complete for the strong perfect graph Conjecture
- Polytope des independants d'un graphe série-parallèle
- A classification of certain graphs with minimal imperfection properties
- Finding an induced path of given parity in planar graphs in polynomial time
- On chordal and perfect plane near-triangulations
- Classes of perfect graphs
- Efficient parallel and sequential algorithms for 4-coloring perfect planar graphs
- Coloring planar perfect graphs by decomposition
- The strong perfect graph conjecture holds for diamonded odd cycle-free graphs
- Some inequalities on the chromatic number of a graph
- The strong perfect graph conjecture for toroidal graphs
- Clique-perfectness and balancedness of some graph classes
- Colouring perfect planar graphs in parallel
- Completeness for intersection classes
- The optimal cost chromatic partition problem for trees and interval graphs
- Circular representation problem on hypergraphs
This page was built for publication: The Strong Perfect Graph Conjecture for Planar Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5663885)
