Abstract

AbstractLet 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.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.