scientific article; zbMATH DE number 1472137

MaRDI QIDQ4489189zbMATH OpenFDO

Authors Darryn Bryant

Publication date 9 July 2000

zbMATH Keywords

\(G\)-designsdecompositionsHamilton cyclelarge sets

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Large sets of Hamilton cycle and path decompositions
• Large sets of Hamilton cycle and path decompositions of complete bipartite graphs
• Large sets of almost Hamilton cycle and path decompositions of complete bipartite graphs
• Large sets of Hamilton cycle decompositions of complete bipartite graphs
• Hamiltonian decompositions of complete \(k\)-uniform hypergraphs

Cited in

(11)

• A new class for large sets of almost Hamilton cycle decompositions
• Large sets of Hamilton cycle and path decompositions of complete bipartite graphs
• Large sets of wrapped Hamilton cycle decompositions of complete tripartite graphs
• On large sets of almost Hamilton cycle decompositions
• scientific article; zbMATH DE number 2190092 (Why is no real title available?)
• Large sets of wrapped K-K Hamilton cycle decompositions of complete bipartite 3-uniform hypergraphs
• Combinatorial properties of the G-degree
• Large sets of almost Hamilton cycle and path decompositions of complete bipartite graphs
• Large sets of Hamilton cycle decompositions of complete bipartite graphs
• Large sets of Hamilton cycle and path decompositions
• Cyclic Hamiltonian cycle systems of the -fold complete and cocktail party graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4489189)