On the construction of odd cycle systems

From MaRDI portal
Revision as of 21:57, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3483304

DOI10.1002/jgt.3190130405zbMath0704.05031OpenAlexW2163569587MaRDI QIDQ3483304

D. G. Hoffman, C. A. Rodger, Charles C. Lindner

Publication date: 1989

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190130405




Related Items (40)

Maximum packings with odd cycles\(C_{4p}\)-frame of complete multipartite multigraphs\(2p\)-cycle decompositions of some regular graphs and digraphsDifference families in \(\text{Z}_{2d+1}\oplus \text{Z}_{2d+1}\) and infinite translation designs in \(\text{Z} \oplus \text{Z}\)Decomposing the complete graph and the complete graph minus a 1-factor into copies of a graph \(G\) where \(G\) is the union of two disjoint cyclesOn Decomposing the Complete Graph into the Union of Two Disjoint CyclesDecomposing various graphs into short even-length cyclesUnnamed ItemCycle decompositions. IV: Complete directed graphs and fixed length directed cyclesPrimitive cycle decompositions of Kn and Kn−IA reduction of the spectrum problem for odd sun systems and the prime caseSunlet decomposition of certain equipartite graphsA survey on the existence ofG-DesignsOn cycle systems with specified weak chromatic numberDecomposition of the tensor product of complete graphs into cycles of lengths 3 and 6The spectrum for lambda-fold 2-perfect 6-cycle systems4-cycle systems of \(K_n-E(F^\ast)\)\(d\)-cube decompositions of \(K_n\setminus K_m\)Decomposing certain equipartite graphs into sunlet graphs of length \(2p\)Nesting directed cycle systems of even lengthMaximum cyclic 4-cycle packings of the complete multipartite graphDihedral Hamiltonian Cycle Systems of the Cocktail Party GraphPack graphs with subgraphs of size three2-perfect \(m\)-cycle systemsDecompositions of complete multigraphs into cycles of varying lengthsEmbedding partial odd-cycle systems in systems with orders in all admissible congruence classesA complete solution to the existence problem for 1-rotationalk-cycle systems ofKvEven‐cycle systems with prescribed automorphism groupsLarge Sets of Wrapped K–K Hamilton Cycle Decompositions of Complete Bipartite 3‐Uniform HypergraphsCycle decompositions III: Complete graphs and fixed length cyclesResolvable even cycle decompositions of the tensor product of complete graphs$C_4$-decomposition of the tensor product of complete graphsDoyen-Wilson Results for Odd Length Cycle SystemsUnnamed ItemNeighbor designs and m-wheel systemsA solution to the forest leave problem for partial 6-cycle systemsUnnamed ItemCycle decompositions of \(K_n\) and \(K_n-I\)Decomposition of the Kneser graph into paths of length fourPacking pentagons into complete graphs: How clumsy can you get?



Cites Work


This page was built for publication: On the construction of odd cycle systems