The 3-edge-components and a structural description of all 3-edge-cuts in a graph

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

Let G = (V, E) be an undirected graph, |V| = n. We denote V1 the partition of V into maximal vertex subsets indivisible by k(-edge)-cuts1 k < l, of the whole G. The factor-graph of G corresponding to V3 is known to give a clear representation of V2, V3 and of the system of cuts of G with 1 and 2 edges. Here a (graph invariant) structural description of V4 and of the system of 3-cuts in an arbitrary graph G is suggested. It is based on a new concept of the 3-edge-connected components of a graph (with vertex sets from V3). The 3-cuts of G are classified so that the classes are naturally 1:1 correspondent to the 3-cuts of the 3-edge-connected components. A class can be reconstructed in a simple way from the component cut, using the relation of the component to the system of 2-cuts of G. For 3-cuts and V4 of a 3-edge-connected graph we follow [DKL76]. The space complexity of the description suggested is O(n) (though the total number of 3-cuts may be a cubic function of n).

Original languageEnglish
Title of host publicationGraph-Theoretic Concepts in Computer Science - 18th International Workshop, WG 1992, Proceedings
EditorsErnst W. Mayr
PublisherSpringer Verlag
Pages145-157
Number of pages13
ISBN (Print)9783540564027
DOIs
StatePublished - 1 Jan 1993
Externally publishedYes
Event18th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1992 - Wiesbaden-Naurod, Germany
Duration: 18 Jun 199220 Jun 1992

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume657 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference18th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 1992
Country/TerritoryGermany
CityWiesbaden-Naurod
Period18/06/9220/06/92

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science (all)

Fingerprint

Dive into the research topics of 'The 3-edge-components and a structural description of all 3-edge-cuts in a graph'. Together they form a unique fingerprint.

Cite this