A class of h-perfect graphs

DOI10.1016/0012-365X(84)90071-2zbMATH Open0548.05054OpenAlexW1966443870MaRDI QIDQ799701FDOQ799701

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

Recommendations

• Two classes of perfect graphs
• Progress on perfect graphs
• Stable set bonding in perfect graphs and parity graphs
• New classes of perfect graphs
• scientific article; zbMATH DE number 3887730

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)

Cites Work

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

Cited In (10)

• A note on kernels and Sperner's Lemma
• On claw-free \(t\)-perfect graphs
• On the stable set polytope of a series-parallel graph
• On cutting-plane proofs in combinatorial optimization
• A min-max relation for stable sets in graphs with no odd-\(K_ 4\)
• Title not available (Why is that?)
• ON THE GORENSTEIN PROPERTY OF THE EHRHART RING OF THE STABLE SET POLYTOPE OF AN H-PERFECT GRAPH
• Claw-free \(t\)-perfect graphs can be recognized in polynomial time
• Characterising claw-free \(t\)-perfect graphs
• Matrices with the Edmonds-Johnson property

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)