Cycle decompositions and constructive characterizations
Decomposing an Eulerian graph into a minimum respectively maximum number of edge disjoint cycles is an NP-complete problem. We prove that an Eulerian graph decomposes into a unique number of cycles if and only if it does not contain two edge disjoint cycles sharing three or more vertices. To this en...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | EJournal Article |
| Published: |
GTA Research Group, Univ. Newcastle, Indonesian Combinatorics Society and ITB,
2019-10-10.
|
| Subjects: | |
| Online Access: | Get Fulltext Get Fulltext |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Internet
Get FulltextGet Fulltext
3rd Floor Main Library
| Call Number: |
A1234.567 |
|---|---|
| Copy 1 | Available |