On decomposition of r-partite graphs into edge-disjoint Hamilton circuits
From MaRDI portal
Publication:1223314
DOI10.1016/0012-365X(76)90039-XzbMath0322.05128OpenAlexW2001684394MaRDI QIDQ1223314
Bruce Auerbach, Renu C. Laskar
Publication date: 1976
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(76)90039-x
Related Items
Cycle systems in the complete bipartite graph minus a one-factor, Amalgamations of factorizations of complete equipartite graphs, Proof of the 1-factorization and Hamilton Decomposition Conjectures, Multiply balanced edge colorings of multigraphs, Fair 1-factorizations and fair holey 1-factorizations of complete multipartite graphs, Embedding an edge-colored \(K(a^{(p)};\lambda,\mu)\) into a Hamiltonian decomposition of \(K(a^{(p+r)};\lambda,\mu)\), Hamiltonian decomposition of complete regular multipartite digraphs, Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars, Some multi-color Ramsey numbers on stars versus path, cycle or wheel, Compatible spanning circuits in edge-colored graphs, Hamilton cycle rich 2-factorization of complete equipartite graphs. II, Decomposing various graphs into short even-length cycles, Orthogonally Resolvable Cycle Decompositions, The perfect matching and tight Hamilton cycle decomposition of complete \(n\)-balanced \(mk\)-partite \(k\)-uniform hypergraphs, 3-path-connectivity of Cayley graphs generated by transposition trees, A generalization of group divisible t $t$‐designs, The \(r\)-matching sequencibility of complete graphs, The complexity of finding low chromatic spanning sub(di)graphs with prescribed connectivity properties, Hamilton decompositions of regular expanders: applications, Fractional matching preclusion of product networks, Hamilton path decompositions of complete multipartite graphs, Hamiltonian decomposition of lexicographic product, Large sets of Hamilton cycle decompositions of complete bipartite graphs, Detachments of Amalgamated 3‐Uniform Hypergraphs Factorization Consequences, Constructing fair sports league schedules with regard to strength groups, Hamilton decompositions of balanced complete multipartite graphs with primitive leaves, Monochromatic \(k\)-edge-connection colorings of graphs, Long path and cycle decompositions of even hypercubes, Note on the spanning-tree packing number of lexicographic product graphs, Decomposing Complete Equipartite Multigraphs into Cycles of Variable Lengths: The Amalgamation-detachment Approach, Unnamed Item, \(G\)-designs and related designs, Factorizations of product graphs into cycles of uniform length, The edge-coloring of complete hypergraphs. I, Bipartite 2‐Factorizations of Complete Multipartite Graphs, Unnamed Item, An approximate version of Jackson’s conjecture, Path factorizations of complete multipartite graphs, \(\phi\)-symmetric Hamilton cycle decompositions of graphs, On path factorizations of complete multipartite graphs
Cites Work
