Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
From MaRDI portal
Publication:2482103
DOI10.1016/J.DAM.2007.05.048zbMATH Open1138.05030OpenAlexW2168694080MaRDI QIDQ2482103FDOQ2482103
Authors: Maria Chudnovsky, Guillermo Durán, Flavia Bonomo 
Publication date: 16 April 2008
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10533/139402
Recommendations
- A characterization of claw-free \(b\)-perfect graphs
- Characterising claw-free \(t\)-perfect graphs
- The structure of claw-free perfect graphs
- On claw-free \(t\)-perfect graphs
- Clique-perfectness of claw-free planar graphs
- A description of claw-free perfect graphs
- On the choosability of claw-free perfect graphs
- Strongly perfect claw‐free graphs—A short proof
- Claw-free graphs with strongly perfect complements. Fractional and integral version. I: Basic graphs
- Claw-free graphs with non-clique μ-subgraphs and related geometries
Cites Work
- Title not available (Why is that?)
- The ellipsoid method and its consequences in combinatorial optimization
- Über iterierte Clique-Graphen
- Title not available (Why is that?)
- The strong perfect graph theorem
- Recognizing Berge graphs
- Kernels in perfect line-graphs
- Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs
- Algorithmic Aspects of Vertex Elimination on Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decomposition of balanced matrices
- On balanced graphs
- On clique-transversals and clique-independent sets
- Algorithmic aspects of clique-transversal and clique-independent sets
- Algorithmic Aspects of Neighborhood Numbers
- Claw-free graphs. IV: Decomposition theorem
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- Bull-free Berge graphs are perfect
- Claw-free graphs. III: Circular interval graphs
- Line perfect graphs
- A description of claw-free perfect graphs
- On clique-perfect and K-perfect graphs
- Neighborhood perfect graphs
- A reduction procedure for coloring perfect \(K_ 4\)-free graphs
- Title not available (Why is that?)
Cited In (18)
- On clique-perfect and K-perfect graphs
- Claw-free cubic graphs with clique-transversal number half of their order
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
- Claw-free graphs with strongly perfect complements. Fractional and integral version. II: Nontrivial strip-structures
- The clique-perfectness and clique-coloring of outer-planar graphs
- NP-hardness of the recognition of coordinated graphs
- Clique-transversal sets and clique-coloring in planar graphs
- Partial characterizations of coordinated graphs: Line graphs and complements of forests
- Clique-perfectness of claw-free planar graphs
- On some graph classes related to perfect graphs: a survey
- Variations of maximum-clique transversal sets on graphs
- Characterization and recognition of Helly circular-arc clique-perfect graphs
- Clique-perfectness of complements of line graphs
- Clique-perfectness of complements of line graphs
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
- Clique-perfectness and balancedness of some graph classes
- On clique-transversals and clique-independent sets
This page was built for publication: Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2482103)
