Splitting Lemma for 2-Connected Graphs.
- Resource Type
- Article
- Authors
- Borse, Y. M.
- Source
- ISRN Discrete Mathematics. 2012, p1-7. 7p.
- Subject
- *GRAPH connectivity
*EULERIAN graphs
*MATROIDS
*MATHEMATICS theorems
*DISCRETE mathematics
- Language
- ISSN
- 2090-7788
The article presents information on a research paper on discrete mathematics which discusses 2-connected graphs and their splitting lemma with reference to connected Eulerian graphs of Herbert Fleischner, professor of mathematics. This paper obtains a splitting lemma for 2-connected graphs and characterizes 2-connected Eulerian graphs and hence by extending one of the theorems to characterize connected graphic Eulerian matroids.