Coloring perfect graphs with no balanced skew-partitions
From MaRDI portal
(Redirected from Publication:490982)
Cites work
- scientific article; zbMATH DE number 1033812 (Why is no real title available?)
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- Algorithms for some \(H\)-join decompositions
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- An algorithm for finding homogeneous pairs
- Berge trigraphs
- Combinatorial optimization with 2-joins
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Decomposing Berge graphs and detecting balanced skew partitions
- Detecting 2-joins faster
- Forbidden induced subgraphs of double-split graphs
- Geometric algorithms and combinatorial optimization
- How the proof of the strong perfect graph conjecture was found
- Normal hypergraphs and the perfect graph conjecture
- Recognizing Berge graphs
- The splittance of a graph
- The strong perfect graph theorem
Cited in
(3)
This page was built for publication: Coloring perfect graphs with no balanced skew-partitions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490982)