Cycle covers of cubic multigraphs (Q686431)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 428293
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cycle covers of cubic multigraphs |
scientific article; zbMATH DE number 428293 |
Statements
Cycle covers of cubic multigraphs (English)
0 references
20 December 1993
0 references
The authors give an alternative proof that any planar multigraph has a cycle \(w\)-cover for any admissible weight \(w\). Their proof does not use the four-color theorem, and provides an extension to admissible (1,2)- weighted cubic multigraphs not containing a subdivision of the Petersen graph.
0 references
cycle covers
0 references
planar multigraph
0 references
cubic multigraphs
0 references
Petersen graph
0 references
0 references
0 references
0.9376842
0 references
0.9297724
0 references
0.92355543
0 references
0.92309827
0 references
0.92054033
0 references
0.9155278
0 references
0 references
