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