Splitting lemma for 2-connected graphs

DOI10.5402/2012/850538zbMath1257.05075OpenAlexW2106825681WikidataQ58692816 ScholiaQ58692816MaRDI QIDQ1935986

Y. M. Borse

Publication date: 21 February 2013

Published in: ISRN Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.5402/2012/850538

zbMATH Keywords

Eulerian graphssplitting lemmasplitting operationconnected graphsconnected graphic Eulerian matroids

Mathematics Subject Classification ID

Combinatorial aspects of matroids and geometric lattices (05B35) Connectivity (05C40) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Eulerian graphs and related topics. Part 1, Volume 1
• Splitting in a binary matroid
• Determination of the bases of a splitting matroid
• On connected splitting matroids
• Unnamed Item
• Unnamed Item

This page was built for publication: Splitting lemma for 2-connected graphs