Distance-hereditary graphs are clique-perfect
From MaRDI portal
Publication:2489948
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
Cites work
- scientific article; zbMATH DE number 2044919 (Why is no real title available?)
- Algorithmic Aspects of Neighborhood Numbers
- Algorithmic aspects of clique-transversal and clique-independent sets
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
- Chains, antichains, and fibres
- Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs
- Clique-transversal sets of line graphs and complements of line graphs
- Completely separable graphs
- Covering all cliques of a graph
- Covering the cliques of a graph with vertices
- Distance-hereditary graphs
- Graph Classes: A Survey
- Handle-rewriting hypergraph grammars
- Maximum \(h\)-colourable subgraph problem in balanced graphs
- Neighborhood perfect graphs
- On clique-transversals and clique-independent sets
- On covering all cliques of a chordal graph
- On the clique-transversal number of chordal graphs
- On the clique-width of some perfect graph classes
- Upper bounds to the clique width of graphs
Cited in
(29)- On some graph classes related to perfect graphs: a survey
- Bounds on the clique-transversal number of regular graphs
- Clique-transversal sets and clique-coloring in planar graphs
- Complete-subgraph-transversal-sets problem on bounded treewidth graphs
- Clique-perfectness of complements of line graphs
- The clique-transversal set problem in claw-free graphs with degree at most 4
- The clique-transversal set problem in \(\{\mathrm{claw},K_4\}\)-free planar graphs
- Upper Clique Transversals in Graphs
- The algorithmic complexity of the minus clique-transversal problem
- Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs
- Approximation algorithms for clique transversals on some graph classes
- On blockers and transversals of maximum independent sets in co-comparability graphs
- Weighted maximum-clique transversal sets of graphs
- Clique-perfectness and balancedness of some graph classes
- Clique-perfectness of complements of line graphs
- Signed and minus clique-transversal functions on graphs
- Unique response Roman domination: complexity and algorithms
- Partial characterizations of clique-perfect and coordinated graphs: superclasses of triangle-free graphs
- Dominating cliques in distance-hereditary graphs
- Clique-transversal number of graphs whose clique-graphs are trees
- Variations of maximum-clique transversal sets on graphs
- Clique-perfectness of claw-free planar graphs
- Approximation algorithms for clique-transversal sets and clique-independent sets in cubic graphs
- Signed clique-transversal functions in graphs
- The clique-perfectness and clique-coloring of outer-planar graphs
- Minimally Unbalanced Diamond-Free Graphs and Dyck-Paths
- Clique cycle-transversals in distance-hereditary graphs
- On the complexity of variations of mixed domination on graphs
- Distance hereditary graphs \(G\) of connectivity two or three and \(\operatorname{diam} (G) = \operatorname{diam} (\overline{G}) = 3\) are reconstructible
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)
