Splitting Lemma for 2-Connected Graphs. (25th November 2012)
- Record Type:
- Journal Article
- Title:
- Splitting Lemma for 2-Connected Graphs. (25th November 2012)
- Main Title:
- Splitting Lemma for 2-Connected Graphs
- Authors:
- Borse, Y. M.
- Other Names:
- Bozapalidis S. Academic Editor.
Kranakis E. Academic Editor.
Wang W. Academic Editor. - Abstract:
- Abstract : 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.
- Is Part Of:
- ISRN discrete mathematics. Volume 2012(2012)
- Journal:
- ISRN discrete mathematics
- Issue:
- Volume 2012(2012)
- Issue Display:
- Volume 2012, Issue 2012 (2012)
- Year:
- 2012
- Volume:
- 2012
- Issue:
- 2012
- Issue Sort Value:
- 2012-2012-2012-0000
- Page Start:
- Page End:
- Publication Date:
- 2012-11-25
- Subjects:
- Discrete mathematics -- Periodicals
Computer science -- Mathematics
Computer science -- Mathematics
Periodicals
511.1 - Journal URLs:
- https://www.hindawi.com/journals/isrn/contents/isrn.discrete.mathematics/ ↗
http://bibpurl.oclc.org/web/53927 ↗ - DOI:
- 10.5402/2012/850538 ↗
- Languages:
- English
- ISSNs:
- 2090-7788
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library HMNTS - ELD Digital store
- Ingest File:
- 18432.xml