Premium
A charcterization of 4‐edge‐connected eulerian graphs
Author(s) -
Weidl Peter
Publication year - 1995
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190200111
Subject(s) - eulerian path , combinatorics , mathematics , vertex (graph theory) , spanning tree , graph , enhanced data rates for gsm evolution , dual graph , discrete mathematics , line graph , computer science , pure mathematics , lagrangian , telecommunications
Let v be an arbitrary vertex of a 4‐edge‐connected Eulerian graph G . First we show the existence of a nonseparating cycle decompositiion of G with respect to v . With the help of this decomposition we are then able to construct 4 edge‐independent spanning trees with the common root v in the sam graph. We conclude that an Eulerian graph G is 4‐edge‐connected iff for every vertex r ϵ V ( G ) there exist 4 edge‐independent spanning trees with a common root r . © 1996 John Wiley & Sons, Inc.