Characterising claw-free t-perfect graphs

DOI10.1016/J.ENDM.2009.07.083MaRDI QIDQ2851509zbMATH OpenOpenAlexFDO

Authors Henning Bruhn, Maya Stein

Publication date 10 October 2013

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2009.07.083

zbMATH Keywords

colouringclaw-free graphs\(t\)-perfect graphsstable set polytope (SSP)

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Recommendations

• On claw-free t-perfect graphs
• Claw-free \(t\)-perfect graphs can be recognised in polynomial time
• Claw-free \(t\)-perfect graphs can be recognized in polynomial time
• \(t\)-perfection in \(P_5\)-free graphs
• \(t\)-perfection is always strong for claw-free graphs

Cites work

• A class of h-perfect graphs
• Coloring quasi-line graphs
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Compositions of Graphs and Polyhedra II: Stable Sets
• Maximum matching and a polyhedron with 0,1-vertices
• On certain polytopes associated with graphs
• On claw-free t-perfect graphs
• On the stable set polytope of a series-parallel graph
• Polytope des independants d'un graphe série-parallèle
• The Graphs with All Subgraphs T-Perfect
• The strong perfect graph theorem
• Transformations which Preserve Perfectness and H-Perfectness of Graphs

Cited in

(9)

• On claw-free t-perfect graphs
• Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
• The \(\langle t \rangle \)-property of some classes of graphs
• \(t\)-perfection is always strong for claw-free graphs
• \(t\)-perfection in \(P_5\)-free graphs
• On the choice number of claw-free perfect graphs
• Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
• Claw-free \(t\)-perfect graphs can be recognised in polynomial time
• Claw-free \(t\)-perfect graphs can be recognized in polynomial time

This page was built for publication: Characterising claw-free \(t\)-perfect graphs

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