scientific article

zbMath0791.05081MaRDI QIDQ3142415

Bill Jackson

Publication date: 28 June 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

circuit decompositioneulerian graphcircuit cover

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (31)

Cycle covers. II: Circuit chain, Petersen chain and Hamilton weights. ⋮ Hamilton weights and Petersen minors ⋮ An overview of graph covering and partitioning ⋮ Even cycle decompositions of index 3 by a novel coloring technique ⋮ On 4-connected 4-regular graphs without even cycle decompositions ⋮ On even circuit decompositions of eulerian graphs ⋮ The construction and reduction of strong snarks ⋮ Construction of permutation snarks ⋮ Even-cycle decompositions of graphs with no odd-\(K_4\)-minor ⋮ Nowhere-zero 4-flows and cycle double covers ⋮ Strongly even cycle decomposable 4-regular line graphs ⋮ On even cycle decompositions of 4-regular line graphs ⋮ Even cycles and even 2-factors in the line graph of a simple graph ⋮ Hamiltonian weights and unique 3‐edge‐colorings of cubic graphs ⋮ On even cycle decompositions of line graphs of cubic graphs ⋮ Edge-partitioning 3-edge-connected graphs into paths ⋮ Cycle double covers and the semi-Kotzig frame ⋮ Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three ⋮ Strongly even cycle decomposable non-planar line graphs ⋮ Even cycle decompositions of 4-regular graphs and line graphs ⋮ Generation and properties of snarks ⋮ Kotzig frames and circuit double covers ⋮ Cubic Graphs with No Short Cycle Covers ⋮ Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems ⋮ Cycle covers (I) - minimal contra pairs and Hamilton weights ⋮ Compatible circuit decompositions of 4‐regular graphs ⋮ Locally self-avoiding Eulerian tours ⋮ Triangle-free circuit decompositions and Petersen minor ⋮ Circle graphs and the cycle double cover conjecture ⋮ Circuit Double Covers of Graphs ⋮ The Pure Prime Circle Orbit Conjecture

This page was built for publication: