A class of h-perfect graphs

DOI10.1016/0012-365X(84)90071-2zbMath0548.05054OpenAlexW1966443870MaRDI QIDQ799701

Najiba Sbihi, Jean-Pierre Uhry

Publication date: 1984

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(84)90071-2

zbMATH Keywords

independent setsh-perfectSeries-parallel graphs

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Graph theory (05C99)

Related Items (9)

Matrices with the Edmonds-Johnson property ⋮ On the stable set polytope of a series-parallel graph ⋮ On cutting-plane proofs in combinatorial optimization ⋮ On claw-free \(t\)-perfect graphs ⋮ ON THE GORENSTEIN PROPERTY OF THE EHRHART RING OF THE STABLE SET POLYTOPE OF AN H-PERFECT GRAPH ⋮ A note on kernels and Sperner's Lemma ⋮ A min-max relation for stable sets in graphs with no odd-\(K_ 4\) ⋮ Claw-Free $t$-Perfect Graphs Can Be Recognized in Polynomial Time ⋮ Characterising claw-free t-perfect graphs

Cites Work

• Polytope des independants d'un graphe série-parallèle
• Maximal Flow Through a Network
• Transformations which Preserve Perfectness and H-Perfectness of Graphs
• Blocking and anti-blocking pairs of polyhedra

This page was built for publication: A class of h-perfect graphs