Pages that link to "Item:Q1142224"
From MaRDI portal
The following pages link to A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\) (Q1142224):
Displayed 42 items.
- On the directed Oberwolfach problem with equal cycle lengths (Q405089) (← links)
- A survey on Hamilton cycles in directed graphs (Q412269) (← links)
- On the \((h,k)\)-domination numbers of iterated line digraphs (Q444453) (← links)
- Decomposition of complete bipartite digraphs and complete digraphs into directed paths and directed cycles of fixed even length (Q497372) (← links)
- The thickness and chromatic number of \(r\)-inflated graphs (Q709322) (← links)
- Directed Hamilton cycle decompositions of the tensor products of symmetric digraphs (Q844233) (← links)
- Nomadic decompositions of bidirected complete graphs (Q932653) (← links)
- Maximal sets of Hamilton cycles in \(D_n\) (Q932696) (← links)
- Large sets of Hamilton cycle and path decompositions (Q947816) (← links)
- Directed cyclic Hamiltonian cycle systems of the complete symmetric digraph (Q1011715) (← links)
- Hamiltonian decomposition of lexicographic products of digraphs (Q1127876) (← links)
- Hamiltonian decomposition of \(K^*_ n\), patterns with distinct differences, and Tuscan squares (Q1182863) (← links)
- Balanced directed cycle designs based on groups (Q1182947) (← links)
- Resolvable tree designs (Q1200005) (← links)
- Edge-disjoint spanners of complete graphs and complete digraphs (Q1301660) (← links)
- On the genus of joins and compositions of graphs (Q1377861) (← links)
- Hamiltonian decomposition of complete regular multipartite digraphs (Q1377885) (← links)
- Hamilton circuits in the directed wrapped Butterfly network (Q1392560) (← links)
- Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles (Q1399917) (← links)
- On covers of graphs (Q1422433) (← links)
- On \((n,k)\)-sequences (Q1582080) (← links)
- Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number (Q1602705) (← links)
- Optimal packing of even circuits into a \(\text{DK}_ v\) (Q1918209) (← links)
- On Hering decomposition of DK\(_n\) induced by group actions on conjugacy classes (Q1972358) (← links)
- Linear arboricity of regular digraphs (Q2013125) (← links)
- Probabilistic and systematic coverage of consecutive test-method pairs for detecting order-dependent flaky tests (Q2044204) (← links)
- Strong subgraph connectivity of digraphs (Q2045390) (← links)
- Extremal results for directed tree connectivity (Q2117576) (← links)
- Minimally strong subgraph \((k,\ell ) \)-arc-connected digraphs (Q2151209) (← links)
- Lempel-Ziv-like parsing in small space (Q2205632) (← links)
- New theoretical bounds and constructions of permutation codes under block permutation metric (Q2329402) (← links)
- Hamilton decompositions of regular expanders: applications (Q2434714) (← links)
- Decompositions of complete uniform hypergraphs into Hamilton Berge cycles (Q2452426) (← links)
- Optical index of fault tolerant routings in WDM networks (Q3057172) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- Small embeddings of partial directed cycle systems (Q3993947) (← links)
- Packing, counting and covering Hamilton cycles in random directed graphs (Q5918227) (← links)
- Large sets of disjoint pure Mendelsohn triple systems (Q5935430) (← links)
- TSP tour domination and Hamilton cycle decompositions of regular digraphs (Q5939600) (← links)
- On the directed Oberwolfach problem for complete symmetric equipartite digraphs and uniform‐length cycles (Q6086218) (← links)
- Directed Steiner tree packing and directed tree connectivity (Q6093140) (← links)
- Completing the solution of the directed Oberwolfach problem with cycles of equal length (Q6187009) (← links)