Skip to main content
SpringerLink
Log in

Ascending Subgraph Decompositions in Oriented Complete Balanced Tripartite Graphs

  • Original Paper
  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract

In 1987, Alavi, Boals, Chartrand, Erdös, and Oellermann conjectured that all graphs have an ascending subgraph decomposition (ASD). Though different classes of graphs have been shown to have an ASD, the conjecture remains open. In this paper we investigate the similar problem for digraphs. In particular, we will show that any orientation of a compete balanced tripartite graph has an ASD.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Alavi Y., Boals A.J., Chartrand G., Erdös P., Oellermann O.: The ascending subgraph decomposition problem. Congr. Numer. 58, 7–14 (1987)

    MathSciNet  Google Scholar 

  2. Chartrand G., Lesniak L.: Graphs & Digraphs, 4th edn. Chapman & Hall/CRC, Boca Raton (2005)

    Google Scholar 

  3. Fu H.: A note on the ascending subgraph decomposition problem. Disc. Math. 84, 315–318 (1990)

    Article  MATH  Google Scholar 

  4. Fu H., Hu W.: A note on ascending subgraph decompositions of regular graphs. Disc. Math. 253, 11–18 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  5. Liu J.: The equipartite Oberwolfach problem with uniform tables. J. Comb. Theory Ser. A 101, 20–34 (2003)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Mathematics and Statistics, University of Tennessee at Martin, Martin, TN, 38238, USA

    Brian C. Wagner

Authors
  1. Brian C. Wagner
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Brian C. Wagner.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wagner, B.C. Ascending Subgraph Decompositions in Oriented Complete Balanced Tripartite Graphs. Graphs and Combinatorics 29, 1549–1555 (2013). https://doi.org/10.1007/s00373-012-1208-5

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00373-012-1208-5

Keywords

Mathematics Subject Classification (2000)

Search

Navigation