The following pages link to (Q3197858):
Displaying 49 items.
- Edge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges (Q269484) (← links)
- A note on edge-disjoint Hamilton cycles in line graphs (Q295256) (← links)
- Hamiltonian cycles in spanning subgraphs of line graphs (Q298990) (← links)
- Fault-tolerant cycles embedding in hypercubes with faulty edges (Q507746) (← links)
- Paley graphs have Hamilton decompositions (Q658027) (← links)
- Hamilton cycle decompositions of the tensor products of complete bipartite graphs and complete multipartite graphs (Q710567) (← links)
- Edge-disjoint Hamilton cycles in graphs (Q713971) (← links)
- Decomposing the cube into paths (Q740656) (← links)
- Directed Hamilton cycle decompositions of the tensor products of symmetric digraphs (Q844233) (← links)
- Hamilton cycle decompositions of the tensor product of complete multipartite graphs (Q932683) (← links)
- Some problems on Cayley graphs (Q952069) (← links)
- Parallel Lagrange interpolation on \(k\)-ary \(n\)-cubes with maximum channel utilization (Q1009358) (← links)
- Survey on path and cycle embedding in some networks (Q1042541) (← links)
- Hamiltonian decomposition of lexicographic products of digraphs (Q1127876) (← links)
- Path factorizations of complete multipartite graphs (Q1296982) (← links)
- Hamiltonian decompositions of Cayley graphs on Abelian groups (Q1332424) (← links)
- Methods and problems of communication in usual networks (Q1339884) (← links)
- Hamiltonian decomposition of complete regular multipartite digraphs (Q1377885) (← links)
- Kronecker products of paths and cycles: Decomposition, factorization and bi-pancyclicity (Q1379832) (← links)
- Hamilton circuits in the directed wrapped Butterfly network (Q1392560) (← links)
- Hamiltonian double Latin squares (Q1403912) (← links)
- On the identification problems in products of cycles (Q1420607) (← links)
- Decomposition of the product of cycles based on degree partition (Q1630940) (← links)
- \(2p\)-cycle decompositions of some regular graphs and digraphs (Q1637135) (← links)
- Ramsey-nice families of graphs (Q1645058) (← links)
- The number of Hamiltonian decompositions of regular graphs (Q1686305) (← links)
- How many circuits determine an oriented matroid? (Q1786051) (← links)
- Factorizations of product graphs into cycles of uniform length (Q1805375) (← links)
- Round-dance neighbour designs from terraces (Q1810630) (← links)
- Pseudo-Cartesian products and Hamiltonian decompositions of Cayley graphs on abelian groups (Q1815310) (← links)
- Edge exchanges in Hamiltonian decompositions of Kronecker-product graphs (Q1913439) (← links)
- Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey (Q1923505) (← links)
- Linear arboricity of regular digraphs (Q2013125) (← links)
- Long path and cycle decompositions of even hypercubes (Q2033926) (← links)
- Factorizations of the product of cycles (Q2176166) (← links)
- Resolvable even cycle decompositions of the tensor product of complete graphs (Q2275406) (← links)
- Hamilton decompositions of one-ended Cayley graphs (Q2284729) (← links)
- Matching preclusion for \(n\)-dimensional torus networks (Q2357377) (← links)
- Hamiltonian paths in spanning subgraphs of line graphs (Q2400567) (← links)
- Edge-disjoint spanners in Cartesian products of graphs (Q2487981) (← links)
- On resolvable multipartite \(G\)-designs. II (Q2494125) (← links)
- Some basic properties of multiple Hamiltonian covers (Q2500529) (← links)
- Graphs as navigational infrastructure for high dimensional data spaces (Q2513376) (← links)
- Eulerian tour algorithms for data visualization and the \({{\mathtt PairViz}}\) package (Q2513377) (← links)
- Brian Alspach and his work (Q2568489) (← links)
- Routing multiple paths in hypercubes (Q3358210) (← links)
- Decomposition of cartesian product of complete graphs into sunlet graphs of order eight (Q5884129) (← links)
- Hamiltonian decompositions of 4‐regular Cayley graphs of infinite abelian groups (Q6057642) (← links)
- Solution to the outstanding case of the spouse‐loving variant of the Oberwolfach problem with uniform cycle length (Q6188115) (← links)
