Skip to main content
Springer Nature Link
Log in

Factorizations of Km,n into Spanning Trees

  • Published:
Graphs and Combinatorics Aims and scope Submit manuscript

Abstract.

 We establish necessary and sufficient conditions for the existence of a spanning tree factorization of the complete bipartite graph K m,n.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Explore related subjects

Discover the latest articles and news from researchers in related subjects, suggested using machine learning.

Author information

Authors and Affiliations

  1. 4520 Mathematics Department, Illinois State University, Normal, IL 61790-4520, USA, , , , , , US

    Saad El-Zanati & Charles Vanden Eynden

Authors
  1. Saad El-Zanati
    View author publications

    You can also search for this author inPubMed Google Scholar

  2. Charles Vanden Eynden
    View author publications

    You can also search for this author inPubMed Google Scholar

Additional information

Received: September 1, 1997 Revised: June 29, 1998

Rights and permissions

Reprints and permissions

About this article

Cite this article

El-Zanati, S., Eynden, C. Factorizations of Km,n into Spanning Trees. Graphs Comb 15, 287–293 (1999). https://doi.org/10.1007/s003730050062

Download citation

  • Issue Date:

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

Keywords