Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

An application of the solution of Kirkman's schoolgirl problem: The decomposition of the symmetric oriented complete graph into 3-circuits

From MaRDI portal
Publication:1843575
Jump to:navigation, search

DOI10.1016/0012-365X(74)90149-6zbMath0281.05105OpenAlexW1981729225MaRDI QIDQ1843575

Jean-Claude Bermond

Publication date: 1974

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

Full work available at URL: https://doi.org/10.1016/0012-365x(74)90149-6



Mathematics Subject Classification ID

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


Related Items

Packings and coverings of the complete directed multigraph with 3- and 4-circuits ⋮ Large sets of three types of oriented triple systems ⋮ Optimal packing of even circuits into a \(\text{DK}_ v\) ⋮ Decompositions of complete symmetric directed graphs into the oriented heptagons ⋮ Simple direct constructions for hybrid triple designs ⋮ Zerlegung total gerichteter Graphen in Kreise ⋮ Permutation designs ⋮ Decomposition of the complete directed graph into k-circuits ⋮ Decomposition of \(K_n\) into circuits of odd length ⋮ Quasigroups and tactical systems



Cites Work

  • SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
  • Unnamed Item
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1843575&oldid=14219730"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 11:41.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki