A class of h-perfect graphs

DOI10.1016/0012-365X(84)90071-2MaRDI QIDQ799701zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Two classes of perfect graphs
• Progress on perfect graphs
• Stable set bonding in perfect graphs and parity graphs
• New classes of perfect graphs
• Publication:3222223

Cites work

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

Cited in

(10)

• Characterising claw-free \(t\)-perfect graphs
• A min-max relation for stable sets in graphs with no odd-\(K_ 4\)
• Matrices with the Edmonds-Johnson property
• On the stable set polytope of a series-parallel graph
• On cutting-plane proofs in combinatorial optimization
• scientific article; zbMATH DE number 4031747 (Why is no real title available?)
• On the Gorenstein property of the Ehrhart ring of the stable set polytope of an h-perfect graph
• On claw-free \(t\)-perfect graphs
• A note on kernels and Sperner's Lemma
• Claw-free \(t\)-perfect graphs can be recognized in polynomial time

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q799701)