Searching for "Ear-decompositions of matching covered graphs." – sorted by Relevance.
-
Ear Decompositions of Matching Covered Graphs
- of this report are the sole responsibility of the author(s). Ear decompositions of matching covered graphs
- Cited by 3 (1 self) – Add To MetaCart
-
Matching Covered Graphs and Subdivisions of K 4 and
- an `odd ear'. An ear-decomposition of a matching covered graph G is a sequence K 2 = G 0 ae G 1 ae \Delta
- Add To MetaCart
-
On a conjecture of Lovasz concerning bricks
- . R. Murty to find ear decompositions of matching covered graphs with the least possible number
- Add To MetaCart

