Circuits through prescribed edges. Issue 4 (24th August 2019)
- Record Type:
- Journal Article
- Title:
- Circuits through prescribed edges. Issue 4 (24th August 2019)
- Main Title:
- Circuits through prescribed edges
- Authors:
- Knappe, Paul
Pitz, Max - Abstract:
- Abstract: We prove that a connected graph G contains a circuit—a closed walk that repeats no edges—through any k prescribed edges if and only if G contains no odd cut of size at most k .
- Is Part Of:
- Journal of graph theory. Volume 93:Issue 4(2020)
- Journal:
- Journal of graph theory
- Issue:
- Volume 93:Issue 4(2020)
- Issue Display:
- Volume 93, Issue 4 (2020)
- Year:
- 2020
- Volume:
- 93
- Issue:
- 4
- Issue Sort Value:
- 2020-0093-0004-0000
- Page Start:
- 470
- Page End:
- 482
- Publication Date:
- 2019-08-24
- Subjects:
- closed trails -- circuits -- Eulerian subgraph
Graph theory -- Periodicals
511 - Journal URLs:
- http://onlinelibrary.wiley.com/journal/10.1002/(ISSN)1097-0118 ↗
http://onlinelibrary.wiley.com/ ↗ - DOI:
- 10.1002/jgt.22497 ↗
- Languages:
- English
- ISSNs:
- 0364-9024
- Deposit Type:
- Legaldeposit
- View Content:
- Available online (eLD content is only available in our Reading Rooms) ↗
- Physical Locations:
- British Library DSC - 4996.450000
British Library DSC - BLDSS-3PM
British Library HMNTS - ELD Digital store - Ingest File:
- 17338.xml