On claw-free t-perfect graphs
From MaRDI portal
Publication:431021
DOI10.1007/S10107-010-0436-9zbMATH Open1245.05055OpenAlexW1989312278MaRDI QIDQ431021FDOQ431021
Authors: Henning Bruhn, Maya Stein 
Publication date: 26 June 2012
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-010-0436-9
Recommendations
- Characterising claw-free \(t\)-perfect graphs
- The structure of claw-free perfect graphs
- On the choosability of claw-free perfect graphs
- A description of claw-free perfect graphs
- A characterization of claw-free \(b\)-perfect graphs
- On the choice number of claw-free perfect graphs
- Clique-perfectness of claw-free planar graphs
- Claw-free \(t\)-perfect graphs can be recognized in polynomial time
- Claw-free \(t\)-perfect graphs can be recognised in polynomial time
- Strongly perfect claw‐free graphs—A short proof
Coloring of graphs and hypergraphs (05C15) Structural characterization of families of graphs (05C75) Graph minors (05C83) Perfect graphs (05C17)
Cites Work
- The Two-Triangle Case of the Acquaintance Graph
- Geometric algorithms and combinatorial optimization
- The ellipsoid method and its consequences in combinatorial optimization
- On certain polytopes associated with graphs
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A \(max \{m, n \}\) algorithm for determining the graph H from its line graph G
- Title not available (Why is that?)
- Maximum matching and a polyhedron with 0,1-vertices
- The strong perfect graph theorem
- Recognizing Berge graphs
- The structure of claw-free graphs
- Blocking and anti-blocking pairs of polyhedra
- The rank facets of the stable set polytope for claw-free graphs
- Applying Lehman's theorems to packing problems
- Stable Set Polytopes for a Class of Circulant Graphs
- The stable set polytope of quasi-line graphs
- On the stable set polytope of a series-parallel graph
- Coloring quasi-line graphs
- Title not available (Why is that?)
- Relaxations of vertex packing
- Polytope des independants d'un graphe série-parallèle
- Polyhedral characterizations and perfection of line graphs
- Anti-blocking polyhedra
- Transformations which Preserve Perfectness and H-Perfectness of Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Graphs with All Subgraphs T-Perfect
- Compositions of Graphs and Polyhedra II: Stable Sets
- A class of h-perfect graphs
Cited In (15)
- Claw-free graphs with strongly perfect complements. Fractional and integral version. II: Nontrivial strip-structures
- On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets
- The \(\langle t \rangle \)-property of some classes of graphs
- Point partition numbers: perfect graphs
- Strongly perfect claw‐free graphs—A short proof
- \(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
- Integer round-up property for the chromatic number of some \(h\)-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
- Title not available (Why is that?)
- Complementation in T-perfect graphs
- Claw-free \(t\)-perfect graphs can be recognized in polynomial time
- Characterising claw-free \(t\)-perfect graphs
This page was built for publication: On claw-free \(t\)-perfect graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q431021)
