Spanning subgraphs with specified valencies |
| |
| Affiliation: | Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ont., Canada |
| |
| Abstract: | The author has published a necessary and sufficient condition for a finite loopless 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. |
| |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
