scientific article

zbMath0552.05058MaRDI QIDQ3344031

Michel Burlet, Jean Fonlupt

Publication date: 1984

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

perfect graphstriangulated graphsMeyniel graphparity graphs

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph theory (05C99)

Related Items (18)

Recognizing \(i\)-triangulated graphs in \(O(mn)\) time ⋮ Structure and algorithms for (cap, even hole)-free graphs ⋮ A mickey-mouse decomposition theorem ⋮ Amalgams and χ-Boundedness ⋮ Graphs vertex-partitionable into strong cliques ⋮ Decomposition techniques applied to the clique-stable set separation problem ⋮ Substitution and \(\chi\)-boundedness ⋮ 2-clique-bond of stable set polyhedra ⋮ Graphs of Separability at Most Two: Structural Characterizations and Their Consequences ⋮ Even-hole-free graphs part I: Decomposition theorem ⋮ An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs ⋮ Strong cliques in diamond-free graphs ⋮ Stable sets and graphs with no even holes ⋮ On the linear extension complexity of stable set polytopes for perfect graphs ⋮ Detecting strong cliques ⋮ Coloring Meyniel graphs in linear time ⋮ Colouring Some Classes of Perfect Graphs Robustly ⋮ Quasi-star-cutsets and some consequences

This page was built for publication: