Clique-perfectness of claw-free planar graphs

DOI10.1007/S00373-016-1726-7MaRDI QIDQ503649zbMATH OpenOpenAlexFDO

Authors Zuosong Liang, Erfang Shan, Liying Kang

Publication date 13 January 2017

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-016-1726-7

zbMATH Keywords

planar graphclique-independent setclique-perfect graphclique-transversal

Mathematics Subject Classification ID

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

Recommendations

• Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
• The clique-perfectness and clique-coloring of outer-planar graphs
• On clique-transversals and clique-independent sets
• Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
• The clique-transversal set problem in \(\{\mathrm{claw},K_4\}\)-free planar graphs

Cites work

• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 553916 (Why is no real title available?)
• Algorithmic Aspects of Neighborhood Numbers
• Algorithmic aspects of clique-transversal and clique-independent sets
• Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs
• Clique-perfectness of complements of line graphs
• Distance-hereditary graphs are clique-perfect
• Extending matchings in claw-free graphs
• Graph theory
• Maximum \(h\)-colourable subgraph problem in balanced graphs
• On balanced graphs
• On clique-perfect and K-perfect graphs
• On clique-transversals and clique-independent sets
• Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
• Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
• Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
• The strong perfect graph theorem

Cited in

(18)

• On clique-perfect and K-perfect graphs
• On claw-free t-perfect graphs
• The clique-perfectness and clique-coloring of outer-planar graphs
• Strongly perfect claw‐free graphs—A short proof
• scientific article; zbMATH DE number 4135992 (Why is no real title available?)
• On some graph classes related to perfect graphs: a survey
• Equitable clique-coloring in claw-free graphs with maximum degree at most 4
• On the choice number of claw-free perfect graphs
• Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
• The clique-transversal set problem in \(\{\mathrm{claw},K_4\}\)-free planar graphs
• Characterization and recognition of Helly circular-arc clique-perfect graphs
• High-order copositive tensors and its applications
• A generalization of implicit Ore-condition for Hamiltonicity of \(k\)-connected graphs
• Clique-perfectness of complements of line graphs
• Clique-perfectness of complements of line graphs
• On stable cutsets in claw-free graphs and planar graphs
• Clique-perfectness and balancedness of some graph classes
• On clique-transversals and clique-independent sets

This page was built for publication: Clique-perfectness of claw-free planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q503649)