Clique-perfectness of claw-free planar graphs
From MaRDI portal
Publication:503649
DOI10.1007/s00373-016-1726-7zbMath1353.05091OpenAlexW2460692316MaRDI QIDQ503649
Erfang Shan, Zuosong Liang, Li-ying 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
Hypergraphs (05C65) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Equitable clique-coloring in claw-free graphs with maximum degree at most 4 ⋮ On some graph classes related to perfect graphs: a survey ⋮ HIGH-ORDER COPOSITIVE TENSORS AND ITS APPLICATIONS ⋮ A generalization of implicit Ore-condition for Hamiltonicity of \(k\)-connected graphs ⋮ The clique-perfectness and clique-coloring of outer-planar graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximum \(h\)-colourable subgraph problem in balanced graphs
- The strong perfect graph theorem
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
- Extending matchings in claw-free graphs
- On clique-transversals and clique-independent sets
- Algorithmic aspects of clique-transversal and clique-independent sets
- Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs
- Distance-hereditary graphs are clique-perfect
- On balanced graphs
- Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs
- Algorithmic Aspects of Neighborhood Numbers
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
- Clique-perfectness of complements of line graphs
This page was built for publication: Clique-perfectness of claw-free planar graphs
