Distance-hereditary graphs are clique-perfect

Authors:
Chuan-Min Lee;Maw-Shang Chang
Affiliations:
Department of Computer Science and Information Engineering, National Chung Cheng University, Ming-Hsiung, Chiayi, Taiwan, ROC;Department of Computer Science and Information Engineering, National Chung Cheng University, Ming-Hsiung, Chiayi, Taiwan, ROC
Venue:
Discrete Applied Mathematics
Year:
2006

Citing 20
Cited 2

Distance-hereditary graphs

Journal of Combinatorial Theory Series B
Neighborhood perfect graphs

Discrete Mathematics
Chains, antichains, and fibres

Journal of Combinatorial Theory Series A
Completely separable graphs

Discrete Applied Mathematics - Computational combinatiorics
Clique-transversal sets of line graphs and complements of line graphs

Discrete Mathematics
Covering all cliques of a graph

Discrete Mathematics - Topics on domination
Covering the cliques of a graph with vertices

Discrete Mathematics - Topological, algebraical and combinatorial structures; Froli´k's memorial volume
Algorithmic aspects of neighborhood numbers

SIAM Journal on Discrete Mathematics
Handle-rewriting hypergraph grammars

Journal of Computer and System Sciences
On covering all cliques of a chordal graph

Discrete Mathematics
Algorithmic aspects of the generalized clique-transversal problem on chordal graphs

Discrete Applied Mathematics
Clique transversal and clique independence on comparability graphs

Information Processing Letters
Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs

SIAM Journal on Discrete Mathematics
Maximum h-colourable subgraph problem in balanced graphs

Information Processing Letters
On the clique-transversal number of chordal graphs

Discrete Mathematics
Graph classes: a survey

Graph classes: a survey
Upper bounds to the clique width of graphs

Discrete Applied Mathematics
Two minimum dominating sets with minimum intersection in chordal graphs

Nordic Journal of Computing
Maximum Clique Transversals

WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Dynamic Programming on Distance-Hereditary Graphs

ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation

Signed and minus clique-transversal functions on graphs

Information Processing Letters
Partial characterizations of clique-perfect and coordinated graphs: Superclasses of triangle-free graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

In this paper, we show that the clique-transversal number τC(G) and the clique-independence number αC(G) are equal for any distance-hereditary graph G. As a byproduct of proving that τC(G) = αC(G), we give a linear-time algorithm to find a minimum clique-transversal set and a maximum clique-independent set simultaneously for distance-hereditary graphs.