Contents

Ars Combinatoria

  • Research article

Short Proofs of Theorems of Nash-Williams and Tutte

S.Louis Hakimi 1, John Mitchem2, Edward Schmeichel 2
1 Department of Electrical and Computer Engineering University of California Davis, CA 95616
2Department of Mathematics and Computer Science San Jose State University San Jose, CA 95192
  • Published: 31/12/1998

Abstract

We give short proofs of theorems of Nash-Williams (on edge-partitioning a graph into acyclic subgraphs) and of Tutte (on edge-partitioning a graph into connected subgraphs). We also show that each theorem can be easily derived from the other.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
S.Louis Hakimi , John Mitchem, Edward Schmeichel . Short Proofs of Theorems of Nash-Williams and Tutte[J], Ars Combinatoria, Volume 050. 257-266. DOI: .