Skip to main content
SpringerLink
Log in

Decompositions of complete symmetric digraphs into the four oriented quadrilaterals

  • Contributed Papers
  • Conference paper
  • First Online:
Combinatorial Mathematics

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 686))

Abstract

We provide necessary and sufficient conditions for the existence of a decomposition of the set of arcs of a complete symmetric digraph into each of the four oriented quadrilaterals.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J.C. Bermond and D. Sotteau, Graph decompositions and G-designs. Proc. 5th British Combinatorial Conf., U.M.P.I., Winnipeg (1976) 53–72.

    Google Scholar 

  2. F. Harary, Graph Theory. Addison-Wesley, Reading (1969).

    MATH  Google Scholar 

  3. F. Harary, E.M. Palmer and C.A.B. Smith, Which graphs have only self-converse orientations? Canad. Math. Bull. 10 (1967) 425–429.

    Article  MathSciNet  MATH  Google Scholar 

  4. F. Harary, R.W. Robinson and N.C. Wormald, Isomorphic factorisations I: Complete graphs. Trans. Amer. Math. Soc. (to appear).

    Google Scholar 

  5. F. Harary and W.D. Wallis, Isomorphic factorizations II: Combinatorial designs. Proc. 8th S.E. Conf. Combinatorics, Graph Theory and Computing, U.M.P.I., Winnipeg (to appear).

    Google Scholar 

  6. S.H.Y. Hung and N.S. Mendelsohn, Directed triple systems. J. Combinatorial Theory, 14A (1973) 310–318.

    Article  MathSciNet  MATH  Google Scholar 

  7. N.S. Mendelsohn, A natural generalization of Steiner triple systems. Computers in Number Theory, Academic Press, New York (1971) 323–338.

    Google Scholar 

  8. A. Rosa and C. Huang, Another class of balanced graph designs: Balanced circuit designs. Discrete Math. 12 (1975) 269–293.

    Article  MathSciNet  MATH  Google Scholar 

  9. J. Schönheim, Partition of the edges of the directed complete graph into 4-cycles. Discrete Math. 11 (1975) 67–70.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics, University of Michigan, 48109, Ann Arbor, Michigan, United States of America

    Frank Harary

  2. Department of Mathematics, University of Newcastle, 2308, New South Wales, Australia

    W. D. Wallis & Katherine Heinrich

Authors
  1. Frank Harary
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. W. D. Wallis
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Katherine Heinrich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

D. A. Holton Jennifer Seberry

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag

About this paper

Cite this paper

Harary, F., Wallis, W.D., Heinrich, K. (1978). Decompositions of complete symmetric digraphs into the four oriented quadrilaterals. In: Holton, D.A., Seberry, J. (eds) Combinatorial Mathematics. Lecture Notes in Mathematics, vol 686. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0062529

Download citation

  • DOI: https://doi.org/10.1007/BFb0062529

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08953-7

  • Online ISBN: 978-3-540-35702-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation