Decomposition of \(K_n\) into circuits of odd length

DOI10.1016/0012-365X(76)90084-4zbMath0358.05026MaRDI QIDQ1239166

Dominique Sotteau

Publication date: 1976

Published in: Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (05C99) Directed graphs (digraphs), tournaments (05C20)

Cites Work

• Decomposition of the complete directed graph into k-circuits
• An application of the solution of Kirkman's schoolgirl problem: The decomposition of the symmetric oriented complete graph into 3-circuits
• An existence theory for pairwise balanced designs. I: Composition theorems and morphisms
• On the cyclic decompositions of the complete graph into polygons with odd number of edges
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decomposition of \(K_n\) into circuits of odd length