Edge partitions of complete multipartite graphs into equal length circuits

DOI10.1016/0095-8956(77)90029-6zbMath0313.05121OpenAlexW2072841484MaRDI QIDQ1220088

E. J. Cockayne, Bert L. Hartnell

Publication date: 1977

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(77)90029-6

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of block designs (05B05) Graph theory (05C99)

Related Items (6)

Odd Decompositions of Eulerian Graphs ⋮ Cyclic cycle systems of the complete multipartite graph ⋮ Closed trail decompositions of complete equipartite graphs ⋮ Decompositions of complete graphs into blown-up cycles \(C_m\)[2] ⋮ \(G\)-designs and related designs ⋮ A linear programming formulation for the maximum complete multipartite subgraph problem

Cites Work

• Unnamed Item
• Unnamed Item
• On the Maximal Number of Pairwise Orthogonal Latin Squares of a Given Order
• On the cyclic decompositions of the complete graph into polygons with odd number of edges
• A general class of invulnerable graphs
• On the Construction of Group Divisible Incomplete Block Designs

This page was built for publication: Edge partitions of complete multipartite graphs into equal length circuits