Compatible circuit decompositions of 4‐regular graphs
From MaRDI portal
Publication:5434256
DOI10.1002/jgt.20262zbMath1128.05044OpenAlexW4247937443MaRDI QIDQ5434256
Bill Jackson, François Genest, Herbert Fleischner
Publication date: 4 January 2008
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20262
Related Items (7)
Cycle covers. II: Circuit chain, Petersen chain and Hamilton weights. ⋮ Construction of permutation snarks ⋮ Four-regular graphs with extremal rigidity properties ⋮ Balanced generic circuits without long paths ⋮ Generation and properties of snarks ⋮ Cycle covers (I) - minimal contra pairs and Hamilton weights ⋮ Circle graphs and the cycle double cover conjecture
Cites Work
This page was built for publication: Compatible circuit decompositions of 4‐regular graphs
