Distance-hereditary graphs are clique-perfect
From MaRDI portal
Publication:2489948
DOI10.1016/J.DAM.2005.07.011zbMATH Open1110.68108OpenAlexW1995194793MaRDI QIDQ2489948FDOQ2489948
Authors: Chuan-Min Lee, Maw-Shang Chang 
Publication date: 28 April 2006
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2005.07.011
Recommendations
- Distance-hereditary graphs
- Dominating cliques in distance-hereditary graphs
- Distance-hereditary and strongly distance-hereditary graphs
- Almost distance-hereditary graphs
- On an extension of distance-hereditary graphs
- On an extension of distance hereditary graphs
- Distance-hereditary digraphs
- Equistable distance-hereditary graphs
- Clique cycle-transversals in distance-hereditary graphs
- (\(k,+\))-distance-hereditary graphs
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Distance in graphs (05C12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Graph Classes: A Survey
- Covering all cliques of a graph
- Upper bounds to the clique width of graphs
- Handle-rewriting hypergraph grammars
- On the clique-width of some perfect graph classes
- Distance-hereditary graphs
- Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
- Maximum \(h\)-colourable subgraph problem in balanced graphs
- Covering the cliques of a graph with vertices
- On clique-transversals and clique-independent sets
- On covering all cliques of a chordal graph
- Algorithmic aspects of clique-transversal and clique-independent sets
- Algorithmic Aspects of Neighborhood Numbers
- Clique-transversal sets of line graphs and complements of line graphs
- On the clique-transversal number of chordal graphs
- Title not available (Why is that?)
- Completely separable graphs
- Chains, antichains, and fibres
- Neighborhood perfect graphs
Cited In (29)
- Weighted maximum-clique transversal sets of graphs
- The clique-perfectness and clique-coloring of outer-planar graphs
- Clique-transversal sets and clique-coloring in planar graphs
- Signed and minus clique-transversal functions on graphs
- On blockers and transversals of maximum independent sets in co-comparability graphs
- Approximation algorithms for clique transversals on some graph classes
- Dominating cliques in distance-hereditary graphs
- Clique-perfectness of claw-free planar graphs
- Clique cycle-transversals in distance-hereditary graphs
- Bounds on the clique-transversal number of regular graphs
- On some graph classes related to perfect graphs: a survey
- Complete-subgraph-transversal-sets problem on bounded treewidth graphs
- The algorithmic complexity of the minus clique-transversal problem
- Variations of maximum-clique transversal sets on graphs
- Unique response Roman domination: complexity and algorithms
- Signed clique-transversal functions in graphs
- The clique-transversal set problem in \(\{\mathrm{claw},K_4\}\)-free planar graphs
- Clique-transversal number of graphs whose clique-graphs are trees
- Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible
- The clique-transversal set problem in claw-free graphs with degree at most 4
- Upper Clique Transversals in 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
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
- Clique-perfectness and balancedness of some graph classes
- Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs
- Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths
- On the complexity of variations of mixed domination on graphs
This page was built for publication: Distance-hereditary graphs are clique-perfect
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489948)
