License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2016.8
URN: urn:nbn:de:0030-drops-62740
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/6274/
Grohe, Martin
Quasi-4-Connected Components
Abstract
We introduce a new decomposition of a graphs into quasi-4-connected components, where we call a graph quasi-4-connected if it is 3-connected and it only has separations of order 3 that separate a single vertex from the rest of the graph. Moreover, we give a cubic time algorithm computing the decomposition of a given graph.
Our decomposition into quasi-4-connected components refines the well-known decompositions of graphs into biconnected and triconnected components. We relate our decomposition to Robertson and Seymour's theory of tangles by establishing a correspondence between the quasi-4-connected components of a graph and its tangles of order 4.
BibTeX - Entry
@InProceedings{grohe:LIPIcs:2016:6274,
author = {Martin Grohe},
title = {{Quasi-4-Connected Components}},
booktitle = {43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016)},
pages = {8:1--8:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-013-2},
ISSN = {1868-8969},
year = {2016},
volume = {55},
editor = {Ioannis Chatzigiannakis and Michael Mitzenmacher and Yuval Rabani and Davide Sangiorgi},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6274},
URN = {urn:nbn:de:0030-drops-62740},
doi = {10.4230/LIPIcs.ICALP.2016.8},
annote = {Keywords: decompositions, connectivity, tangles}
}
Keywords: |
|
decompositions, connectivity, tangles |
Collection: |
|
43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016) |
Issue Date: |
|
2016 |
Date of publication: |
|
23.08.2016 |