Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
DOI10.1016/J.DISC.2007.12.054zbMATH Open1227.05151OpenAlexW2154914679MaRDI QIDQ1025541FDOQ1025541
Authors: Maria Chudnovsky, Guillermo Durán, Flavia Bonomo 
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
Recommendations
- Characterization and recognition of Helly circular-arc clique-perfect graphs
- On cliques of Helly Circular-arc Graphs
- scientific article; zbMATH DE number 2188345
- Partial characterizations of circular-arc graphs
- Partial Characterizations of Circular-Arc Graphs
- Some results on circular perfect graphs and perfect graphs
- Partial characterizations of circle graphs
- Self-clique Helly circular-arc graphs
- On circular-perfect graphs: a survey
- Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75) Perfect graphs (05C17)
Cites Work
- Graph Classes: A Survey
- Algorithmic graph theory and perfect graphs
- Algorithms on circular-arc graphs
- The strong perfect graph theorem
- Recognizing Berge graphs
- Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs
- Distance-hereditary graphs are clique-perfect
- Title not available (Why is that?)
- Clique graphs and Helly graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On clique-transversals and clique-independent sets
- Algorithmic aspects of clique-transversal and clique-independent sets
- Title not available (Why is that?)
- Algorithmic Aspects of Neighborhood Numbers
- Algorithms for finding clique-transversals of graphs
- On clique-complete graphs
- On clique-perfect and K-perfect graphs
- Recognizing balanceable matrices
- On Graphs Without Multicliqual Edges
- Characterization and recognition of Helly circular-arc clique-perfect graphs
- Neighborhood perfect graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (15)
- Claw-free cubic graphs with clique-transversal number half of their order
- The clique-perfectness and clique-coloring of outer-planar graphs
- Clique-transversal sets and clique-coloring in planar graphs
- Clique-perfectness of claw-free planar graphs
- About some robustness and complexity properties of \(G\)-graphs networks
- 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
- Clique-perfectness and balancedness of some graph classes
- On clique-transversals and clique-independent sets
- Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs
- Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths
This page was built for publication: Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1025541)
