Clique cycle-transversals in distance-hereditary graphs
Pages 38 - 44
Abstract
A cycle transversal or feedback vertex set of a graph G is a subset T ź V ( G ) such that T ź V ( C ) ź 0ź for every cycle C of G . A clique cycle transversal, or cct for short, is a cycle transversal which is a clique. Recognizing graphs which admit a cct can be done in polynomial time; however, no structural characterization of such graphs is known. We characterize distance-hereditary graphs admitting a cct in terms of forbidden induced subgraphs. This extends similar results for chordal graphs and cographs.
References
[1]
H.-J. Bandelt, H.M. Mulder, Distance-hereditary graphs, J. Combin. Theory Ser. B, 41 (1986) 182-208.
[2]
A. Brandstädt, Partitions of graphs into one or two independent sets and cliques, Discrete Math., 152 (1996) 47-54.
[3]
A. Brandstädt, Corrigendum, Discrete Math., 186 (1998) 295.
[4]
A. Brandstädt, S. Brito, S. Klein, L.T. Nogueira, F. Protti, Cycle transversals in perfect graphs and cographs, Theoret. Comput. Sci., 469 (2013) 15-23.
[5]
A. Brandstädt, S. Esposito, L.T. Nogueira, F. Protti, Clique cycle-transversals in distance-hereditary graphs (extended abstract), in: Electronic Notes in Discrete Mathematics, vol. 44, 2013, pp. 15-21.
[6]
A. Brandstädt, V.B. Le, J.P. Spinrad, Graph Classes: A Survey, in: SIAM Monographs on Discrete Math. Appl., vol. 3, SIAM, Philadelphia, 1999.
[7]
R.S.F. Bravo, L.T. Nogueira, S. Klein, Cographs ( k, l ) -partitionable, in: Electronic Notes in Discrete Mathematics, vol. 22, 2005, pp. 277-280.
[8]
V. Chvátal, P.L. Hammer, Set-packing and threshold graphs. Res. Report CORR 73-21, University of Waterloo, Ontario, 1973.
[9]
B. Courcelle, J.A. Makowsky, U. Rotics, Linear time solvable optimization problems on graphs of bounded clique-width, Theory Comput. Syst., 33 (2000) 125-150.
[10]
T. Feder, P. Hell, S. Klein, R. Motwani, Complexity of graph partition problems, in: Proc. of the 31st Annual ACM Symposium on Theory of Computing, STOC 99, 1999, pp. 464-472.
[11]
S. Földes, P.L. Hammer, Split graphs, Congr. Numer., 19 (1977) 311-315.
[12]
M. Groshaus, P. Hell, S. Klein, L.T. Nogueira, F. Protti, Cycle transversals in bounded degree graphs, Discrete Math. Theoret. Comput. Sci., 13 (2011) 45-66.
[13]
P. Hell, S. Klein, L.T. Nogueira, F. Protti, Partitioning chordal graphs into independent sets and cliques, Discrete Appl. Math., 141 (2004) 185-194.
[14]
M. Rao, MSOL partitioning problems on graphs of bounded treewidth and clique-width, Theoret. Comput. Sci., 377 (2007) 260-267.
[15]
B. Reed, K. Smith, A. Vetta, Finding odd cycle transversals, Oper. Res. Lett., 32 (2004) 299-301.
[16]
M. Yannakakis, Node- and edge-deletion NP-complete problems, in: Proc. of the Tenth Annual ACM Symposium on Theory of Computing, STOC 78, 1978, pp. 253-264.
[17]
I.E. Zverovich, I.I. Zverovich, An improvement of Gyárfás' bounds on the maximal order of a minimal forbidden induced subgraph for ( 1, 2 ) -split graphs. Research Report RRR 37-2002, RUTCOR, 2002.
Index Terms
- Clique cycle-transversals in distance-hereditary graphs
Index terms have been assigned to the content through auto-classification.
Recommendations
A note on connected dominating sets of distance-hereditary graphs
A vertex subset of a graph is a dominating set if every vertex of the graph belongs to the set or has a neighbor in it. A connected dominating set is a dominating set such that the induced subgraph of the set is a connected graph. A graph is called ...
Cycle transversals in perfect graphs and cographs
A cycle transversal (or feedback vertex set) of a graph G is a subset T@__ __V(G) such that T@__ __V(C)<>0@__ __ for every cycle C of G. This work considers the problem of finding special cycle transversals in perfect graphs and cographs. We prove that ...
Which distance-hereditary graphs are cover-incomparability graphs?
In this paper we deal with cover-incomparability graphs of posets, or briefly C-I graphs. These are graphs derived from posets as the edge-union of their cover graph and their incomparability graph. We answer two recently posed open questions. Which ...
Comments
Information & Contributors
Information
Published In
Copyright © Elsevier B.V.
Publisher
Elsevier Science Publishers B. V.
Netherlands
Publication History
Published: 10 September 2016
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 03 Sep 2024
Other Metrics
Citations
View Options
View options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in