Splitting Lemma for 2-Connected Graphs
Author
Source
Issue
Vol. 2012, Issue 2012 (31 Dec. 2012), pp.1-7, 7 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2012-11-25
Country of Publication
Egypt
No. of Pages
7
Main Subjects
Abstract EN
Using a splitting operation and a splitting lemma for connected graphs, Fleischner characterized connected Eulerian graphs.
In this paper, we obtain a splitting lemma for 2-connected graphs and characterize 2-connected Eulerian graphs.
As a consequence, we characterize connected graphic Eulerian matroids.
American Psychological Association (APA)
Borse, Y. M.. 2012. Splitting Lemma for 2-Connected Graphs. ISRN Discrete Mathematics،Vol. 2012, no. 2012, pp.1-7.
https://search.emarefa.net/detail/BIM-503226
Modern Language Association (MLA)
Borse, Y. M.. Splitting Lemma for 2-Connected Graphs. ISRN Discrete Mathematics No. 2012 (2012), pp.1-7.
https://search.emarefa.net/detail/BIM-503226
American Medical Association (AMA)
Borse, Y. M.. Splitting Lemma for 2-Connected Graphs. ISRN Discrete Mathematics. 2012. Vol. 2012, no. 2012, pp.1-7.
https://search.emarefa.net/detail/BIM-503226
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-503226
