A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
From MaRDI portal
Publication:1142224
DOI10.1016/0095-8956(80)90044-1zbMath0439.05025OpenAlexW2051742761MaRDI QIDQ1142224
Publication date: 1980
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(80)90044-1
Orthogonal arrays, Latin squares, Room squares (05B15) Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20) Eulerian and Hamiltonian graphs (05C45)
Related Items (42)
Directed Hamilton cycle decompositions of the tensor products of symmetric digraphs ⋮ Minimally strong subgraph \((k,\ell ) \)-arc-connected digraphs ⋮ Small embeddings of partial directed cycle systems ⋮ Optimal packing of even circuits into a \(\text{DK}_ v\) ⋮ On the genus of joins and compositions of graphs ⋮ Hamiltonian decomposition of complete regular multipartite digraphs ⋮ Hamiltonian decomposition of lexicographic products of digraphs ⋮ Hamilton circuits in the directed wrapped Butterfly network ⋮ On the directed Oberwolfach problem with equal cycle lengths ⋮ On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles ⋮ Directed Steiner tree packing and directed tree connectivity ⋮ Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles ⋮ A survey on Hamilton cycles in directed graphs ⋮ Completing the solution of the directed Oberwolfach problem with cycles of equal length ⋮ Hamilton decompositions of regular expanders: applications ⋮ Lempel-Ziv-like parsing in small space ⋮ On the \((h,k)\)-domination numbers of iterated line digraphs ⋮ On covers of graphs ⋮ Decompositions of complete uniform hypergraphs into Hamilton Berge cycles ⋮ Nomadic decompositions of bidirected complete graphs ⋮ Maximal sets of Hamilton cycles in \(D_n\) ⋮ On Hering decomposition of DK\(_n\) induced by group actions on conjugacy classes ⋮ Hamiltonian decomposition of \(K^*_ n\), patterns with distinct differences, and Tuscan squares ⋮ Balanced directed cycle designs based on groups ⋮ Decomposition of complete bipartite digraphs and complete digraphs into directed paths and directed cycles of fixed even length ⋮ Large sets of Hamilton cycle and path decompositions ⋮ Packing, counting and covering Hamilton cycles in random directed graphs ⋮ Resolvable tree designs ⋮ Large sets of disjoint pure Mendelsohn triple systems ⋮ TSP tour domination and Hamilton cycle decompositions of regular digraphs ⋮ Linear arboricity of regular digraphs ⋮ The thickness and chromatic number of \(r\)-inflated graphs ⋮ Optical index of fault tolerant routings in WDM networks ⋮ Probabilistic and systematic coverage of consecutive test-method pairs for detecting order-dependent flaky tests ⋮ Strong subgraph connectivity of digraphs ⋮ Directed cyclic Hamiltonian cycle systems of the complete symmetric digraph ⋮ New theoretical bounds and constructions of permutation codes under block permutation metric ⋮ On \((n,k)\)-sequences ⋮ Tournaments and Semicomplete Digraphs ⋮ Edge-disjoint spanners of complete graphs and complete digraphs ⋮ Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number ⋮ Extremal results for directed tree connectivity
Cites Work
This page was built for publication: A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\)
