scientific article
From MaRDI portal
Publication:3197858
zbMath0713.05047MaRDI QIDQ3197858
Dominique Sotteau, Jean-Claude Bermond, Brian Alspach
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)
Related Items (64)
Edge-fault-tolerant pancyclicity and bipancyclicity of Cartesian product graphs with faulty edges ⋮ Decomposition of cartesian product of complete graphs into sunlet graphs of order eight ⋮ Hamiltonian decompositions of Cayley graphs on Abelian groups ⋮ Methods and problems of communication in usual networks ⋮ A note on edge-disjoint Hamilton cycles in line graphs ⋮ Unnamed Item ⋮ Decomposition of the product of cycles based on degree partition ⋮ Hamiltonian cycles in spanning subgraphs of line graphs ⋮ \(2p\)-cycle decompositions of some regular graphs and digraphs ⋮ Directed Hamilton cycle decompositions of the tensor products of symmetric digraphs ⋮ Decomposing hypercubes into regular connected subgraphs ⋮ Ramsey-nice families of graphs ⋮ Edge exchanges in Hamiltonian decompositions of Kronecker-product graphs ⋮ Hamiltonian paths in spanning subgraphs of line graphs ⋮ Hamiltonian decomposition of complete regular multipartite digraphs ⋮ Kronecker products of paths and cycles: Decomposition, factorization and bi-pancyclicity ⋮ Factorizations of the product of cycles ⋮ Hamiltonian cycles and paths in Cayley graphs and digraphs---a survey ⋮ Hamiltonian decomposition of lexicographic products of digraphs ⋮ Unnamed Item ⋮ Hamilton circuits in the directed wrapped Butterfly network ⋮ The number of Hamiltonian decompositions of regular graphs ⋮ Hamiltonian decompositions of 4‐regular Cayley graphs of infinite abelian groups ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Hamiltonian double Latin squares ⋮ Solution to the outstanding case of the spouse‐loving variant of the Oberwolfach problem with uniform cycle length ⋮ On the identification problems in products of cycles ⋮ Paley graphs have Hamilton decompositions ⋮ Hamilton cycle decompositions of the tensor product of complete multipartite graphs ⋮ Extremal values of degree-based entropies of bipartite graphs ⋮ Finding a second Hamiltonian decomposition of a 4-regular multigraph by integer linear programming ⋮ Fault-tolerant cycles embedding in hypercubes with faulty edges ⋮ Some problems on Cayley graphs ⋮ Edge-disjoint spanners in Cartesian products of graphs ⋮ TSP tour domination and Hamilton cycle decompositions of regular digraphs ⋮ Linear arboricity of regular digraphs ⋮ On resolvable multipartite \(G\)-designs. II ⋮ Hamilton cycle decompositions of the tensor products of complete bipartite graphs and complete multipartite graphs ⋮ Edge-disjoint Hamilton cycles in graphs ⋮ Some basic properties of multiple Hamiltonian covers ⋮ Resolvable even cycle decompositions of the tensor product of complete graphs ⋮ How many circuits determine an oriented matroid? ⋮ Routing multiple paths in hypercubes ⋮ Hamilton decompositions of one-ended Cayley graphs ⋮ Long path and cycle decompositions of even hypercubes ⋮ Graphs as navigational infrastructure for high dimensional data spaces ⋮ Eulerian tour algorithms for data visualization and the \({{\mathtt PairViz}}\) package ⋮ On the total chromatic number of the direct product of cycles and complete graphs ⋮ Unnamed Item ⋮ Encryption and decryption using decomposition of complete graph \(K_{3(6n+1)}\) ⋮ Decomposing the cube into paths ⋮ Parallel Lagrange interpolation on \(k\)-ary \(n\)-cubes with maximum channel utilization ⋮ Factorizations of product graphs into cycles of uniform length ⋮ On Hamilton Decompositions of Line Graphs of Non-Hamiltonian Graphs and Graphs without Separating Transitions ⋮ Round-dance neighbour designs from terraces ⋮ Pseudo-Cartesian products and Hamiltonian decompositions of Cayley graphs on abelian groups ⋮ Unnamed Item ⋮ An approximate version of Jackson’s conjecture ⋮ Survey on path and cycle embedding in some networks ⋮ Brian Alspach and his work ⋮ Path factorizations of complete multipartite graphs ⋮ On hamiltonian decompositions of tensor products of graphs ⋮ Matching preclusion for \(n\)-dimensional torus networks
This page was built for publication:
