Abstract
We answer a question of Brandstädt et al. by showing that deciding whether a line graph with maximum degree 5 has a stable cutset is NP-complete. Conversely, the existence of a stable cutset in a line graph with maximum degree at most 4 can be decided efficiently. The proof of our NP-completeness result is based on a refinement on a result due to Chvátal that recognizing decomposable graphs with maximum degree 4 is an NP-complete problem. Here, a graph is decomposable if its vertices can be colored red and blue in such a way that each color appears on at least one vertex but each vertex v has at most one neighbor having a different color from v. We also discuss some open problems on stable cutsets.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Brandstädt, F. Dragan, V.B. Le and T. Szymczak, On stable cutsets in graphs, Discrete Appl. Math. 105 (2000), 39–50.
G. Chen and X. Yu, A note on fragile graphs, Preprint (1998).
V. Chvátal, Recognizing decomposable Graphs, J. Graph Theory 8, (1984), 51–53.
D.G. Corneil, J. Fonlupt, Stable set bonding in perfect graphs and parity graphs, J. Combin. Theory (B) 59 (1993), 1–14.
D. Degiorgi, A new linear algorithm to detect a line graph and output its root graph, Tech. Report 148, Inst. für Theoretische Informatik, ETH Zürich, Zürich, Switzerland (1990)
R.L. Hemminger, L.W. Beineke, Line graphs and line digraphs, In: Selected Topics in Graph Theory I, L.W. Beineke, R.T. Wilson, eds., Academic Press, London, (1978), 271–305.
P.G.H. Lehot, An optimal algorithm to detect a line graph and output its root graph, J. Assoc. Comput. Mach. 21 (1974), 569–575.
L. Lovász, Covering and colorings of hypergraphs, In Proceedings, 4th Southeastern Conference on Combinatorics, Graph Theory and Computing, Utilitas Mathematica, Winnipeg (1973), 3–12.
A.M. Moshi, Matching cutsets in graphs, J. Graph Theory 13, (1989), 527–536.
N.D. Roussopoulos, A O(max m, n) algorithm for determining the graph H from its line graph G, Inf. Process. Lett. 2 (1973), 108–112.
R.E. Tarjan, Decomposition by clique separators, Discrete Math. 55 (1985), 221–232.
A. Tucker, Coloring graphs with stable cutsets, J. Combin. Theory (B) 34 (1983), 258–267.
S.H. Whitesides, An algorithm for finding clique cut-sets, Inf. Process. Lett. 12 (1981), 31–32.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Le, V.B., Randerath, B. (2001). On Stable Cutsets in Line Graphs. In: Brandstädt, A., Le, V.B. (eds) Graph-Theoretic Concepts in Computer Science. WG 2001. Lecture Notes in Computer Science, vol 2204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45477-2_24
Download citation
DOI: https://doi.org/10.1007/3-540-45477-2_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42707-0
Online ISBN: 978-3-540-45477-9
eBook Packages: Springer Book Archive