Publication:3514485
From MaRDI portal
zbMath1157.05035MaRDI QIDQ3514485
Publication date: 21 July 2008
tournament; complete graph; Hamilton cycle; complete multipartite graph; Hamilton decomposition; Euler tour
Related Items
Tree robustness of a graph, A tripling construction for mutually orthogonal symmetric hamiltonian double Latin squares, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, An approximate version of Jackson’s conjecture, On Locality-Sensitive Orderings and Their Applications, Some graph theoretical aspects of generalized truncations, Automorphism groups of Walecki tournaments with zero and odd signatures, Rainbow Cycles in Flip Graphs, Rainbow Cycles in Flip Graphs., The $r$-matching sequencibility of complete multi-$k$-partite $k$-graphs, On covering expander graphs by hamilton cycles, Two Chromatic Conjectures: One for Vertices and One for Edges, Large Sets of Wrapped K–K Hamilton Cycle Decompositions of Complete Bipartite 3‐Uniform Hypergraphs, A New View of Hypercube Genus, Decomposition of cartesian product of complete graphs into sunlet graphs of order eight, The cyclic matching sequenceability of regular graphs, Hamiltonian decompositions of 4‐regular Cayley graphs of infinite abelian groups, Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties, Path decompositions of tournaments, Edge colourings and qualitative representations of chromatic algebras, A complete solution to the two-table Oberwolfach problems, New results on torus cube packings and tilings, Decomposing certain equipartite graphs into sunlet graphs of length \(2p\), Colorful strips, The thickness and chromatic number of \(r\)-inflated graphs, Hamiltonian decompositions of complete \(k\)-uniform hypergraphs, Packing paths in complete graphs, Combinatorial cube packings in the cube and the torus, Ramsey-nice families of graphs, The number of Hamiltonian decompositions of regular graphs, The \(r\)-matching sequencibility of complete graphs, On the asymptotic growth of bipartite graceful permutations, Hamilton path decompositions of complete multipartite graphs, Minimal path decomposition of complete bipartite graphs, New methods to attack the Buratti-Horak-Rosa conjecture, Labeled packing of cycles and circuits, On the Oberwolfach problem for single-flip 2-factors via graceful labelings, Presentations for vertex-transitive graphs, Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars, Packing tree degree sequences, Edge disjoint caterpillar realizations, Distance-two colourings of Barnette graphs, Hamilton decompositions of one-ended Cayley graphs, The spectrum of group-based complete Latin squares, Large sets of wrapped Hamilton cycle decompositions of complete tripartite graphs, \(\phi\)-symmetric Hamilton cycle decompositions of graphs, Maximum uniformly resolvable decompositions of \(K_v\) and \(K_v - I\) into 3-stars and 3-cycles, Recent advances on the Hamiltonian problem: survey III, On tight 6-cycle decompositions of complete 3-uniform hypergraphs, Permutations that separate close elements, Disjoint sub(di)graphs in digraphs, On Locality-Sensitive Orderings and Their Applications, Path and cycle decompositions of dense graphs
