Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs

DOI10.1016/J.DISC.2007.12.054MaRDI QIDQ1025541zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

perfect graphsHelly circular-arc graphsdiamond-free graphsclique-perfect graphsk-perfect graphs

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Structural characterization of families of graphs (05C75) Perfect graphs (05C17)

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

Cites work

• scientific article; zbMATH DE number 5158490 (Why is no real title available?)
• scientific article; zbMATH DE number 22656 (Why is no real title available?)
• scientific article; zbMATH DE number 553916 (Why is no real title available?)
• scientific article; zbMATH DE number 3327126 (Why is no real title available?)
• scientific article; zbMATH DE number 3363617 (Why is no real title available?)
• scientific article; zbMATH DE number 2230210 (Why is no real title available?)
• Algorithmic Aspects of Neighborhood Numbers
• Algorithmic aspects of clique-transversal and clique-independent sets
• Algorithmic graph theory and perfect graphs
• Algorithms for finding clique-transversals of graphs
• Algorithms on circular-arc graphs
• Characterization and recognition of Helly circular-arc clique-perfect graphs
• Clique graphs and Helly graphs
• Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs
• Distance-hereditary graphs are clique-perfect
• Graph Classes: A Survey
• Neighborhood perfect graphs
• On Graphs Without Multicliqual Edges
• On clique-complete graphs
• On clique-perfect and K-perfect graphs
• On clique-transversals and clique-independent sets
• Recognizing Berge graphs
• Recognizing balanceable matrices
• The strong perfect graph theorem

Cited in

(15)

• Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs
• Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths
• 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

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)