Hamiltonian weights and unique 3‐edge‐colorings of cubic graphs
From MaRDI portal
Publication:4843509
DOI10.1002/jgt.3190200110zbMath0854.05070OpenAlexW2150547317MaRDI QIDQ4843509
Publication date: 5 January 1997
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190200110
subdivisioncircuitscolorabilitycubic graphs1-factorizationweightPetersen graphfaithful coverHamilton circuitshamiltonian weight
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Eulerian and Hamiltonian graphs (05C45)
Related Items (7)
On purely tree-colorable planar graphs ⋮ Cycle covers. II: Circuit chain, Petersen chain and Hamilton weights. ⋮ Hamilton weights and Petersen minors ⋮ Uniquely forced perfect matching and unique 3-edge-coloring ⋮ Unique Fulkerson coloring of Petersen minor-free cubic graphs ⋮ Cycle covers (I) - minimal contra pairs and Hamilton weights ⋮ Cycle covers. III: Compatible circuit decomposition and \(K_5\)-transition minor
Cites Work
This page was built for publication: Hamiltonian weights and unique 3‐edge‐colorings of cubic graphs
