Elsevier

Discrete Mathematics

Volume 9, Issue 1, July 1974, Pages 97-108
Discrete Mathematics

Spanning subgraphs with specified valencies

https://doi.org/10.1016/0012-365X(74)90075-2Get rights and content
Under an Elsevier user license
open archive

Abstract

The author has published a necessary and sufficient condition for a finite looplesses graph to have a spanning subgraph with a specified positive valency at each vertex (see [8,9]). In the present paper it is contended that the condition can be made more useful as a tool of graph theory by imposing a maximality condition.

Cited by (0)