Decomposition of K_n into circuits of odd length

DOI10.1016/0012-365X(76)90084-4MaRDI QIDQ1239166zbMATH OpenFDO

Authors D. Sotteau

Publication date 1976

Published in Discrete Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

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

Recommendations

• Cycle decompositions. IV: Complete directed graphs and fixed length directed cycles
• scientific article; zbMATH DE number 436087
• On decomposing K_n -I into cycles of a fixed odd length
• Decomposition of complete bipartite digraphs and complete digraphs into directed paths and directed cycles of fixed even length
• On the construction of odd cycle systems

Cites work

• scientific article; zbMATH DE number 3517174 (Why is no real title available?)
• scientific article; zbMATH DE number 3525152 (Why is no real title available?)
• scientific article; zbMATH DE number 3218576 (Why is no real title available?)
• scientific article; zbMATH DE number 3238443 (Why is no real title available?)
• scientific article; zbMATH DE number 3311772 (Why is no real title available?)
• scientific article; zbMATH DE number 3343725 (Why is no real title available?)
• 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
• Decomposition of the complete directed graph into k-circuits
• On the cyclic decompositions of the complete graph into polygons with odd number of edges

Cited in

(2)

• scientific article; zbMATH DE number 2108151 (Why is no real title available?)
• scientific article; zbMATH DE number 436087 (Why is no real title available?)

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

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