Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
From MaRDI portal
Publication:1025541
DOI10.1016/j.disc.2007.12.054zbMath1227.05151OpenAlexW2154914679MaRDI QIDQ1025541
Guillermo Durán, Maria Chudnovsky, Flavia Bonomo-Braberman
Publication date: 19 June 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.054
Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Perfect graphs (05C17)
Related Items (13)
Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths ⋮ Clique-perfectness and balancedness of some graph classes ⋮ On some graph classes related to perfect graphs: a survey ⋮ Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs ⋮ Variations of maximum-clique transversal sets on graphs ⋮ Clique-transversal sets and clique-coloring in planar graphs ⋮ Clique-perfectness of claw-free planar graphs ⋮ Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs ⋮ Claw-free cubic graphs with clique-transversal number half of their order ⋮ About some robustness and complexity properties of \(G\)-graphs networks ⋮ Clique-perfectness of complements of line graphs ⋮ Clique-perfectness of complements of line graphs ⋮ The clique-perfectness and clique-coloring of outer-planar graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Clique graphs and Helly graphs
- The strong perfect graph theorem
- Algorithms for finding clique-transversals of graphs
- Neighborhood perfect graphs
- On clique-complete graphs
- On clique-transversals and clique-independent sets
- Algorithmic graph theory and perfect graphs
- Algorithmic aspects of clique-transversal and clique-independent sets
- Distance-hereditary graphs are clique-perfect
- Recognizing Berge graphs
- Recognizing balanceable matrices
- Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs
- Characterization and recognition of Helly circular-arc clique-perfect graphs
- On Graphs Without Multicliqual Edges
- Algorithms on circular-arc graphs
- Graph Classes: A Survey
- Algorithmic Aspects of Neighborhood Numbers
This page was built for publication: Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
