On Ear Decompositions of Strongly Connected Bidirected Graphs

Details On Ear Decompositions of Strongly Connected Bidirected Graphs On Ear Decompositions of Strongly Connected Bidirected Graphs

2006-09-08

arxiv.org/abs/math/0609221v1

Mathematics

Combinatorics

16 pages, 5 figures

Scientific paper

Bidirected graphs (earlier studied by Edmonds, Johnson and, in equivalent terms of skew-symmetric graphs, by Tutte, Goldberg, Karzanov, and others) proved to be a useful unifying language for describing both flow and matching problems. In this paper we extend the notion of ear decomposition to the class of strongly connected bidirected graphs. In particular, our results imply Two Ear Theorem on matching covered graphs of Lov\'asz and Plummer. The proofs given here are self-contained except for standard Barrier Theorem on skew-symmetric graphs.

Affiliated with

Also associated with

No associations

Rating

On Ear Decompositions of Strongly Connected Bidirected Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On Ear Decompositions of Strongly Connected Bidirected Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Ear Decompositions of Strongly Connected Bidirected Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-112645