𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Sufficient Condition for a Graph to Have a k-tree

✍ Scribed by Aung Kyaw

Publisher
Springer Japan
Year
2001
Tongue
English
Weight
107 KB
Volume
17
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

More sufficient conditions for a graph t
More sufficient conditions for a graph to have factors
✍ R.P. Anstee; Yunsun Nam πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 459 KB

This paper explores the problem of finding degree constrained subgraphs (i.e. (g, f)-factors) of a given graph using fractional subgraphs as a basis. These fractional subgraphs are often easy to obtain by heuristics. We apply our results to generalize results of Kano, Bermond and Las Vergnas among o

A sufficient condition for a regular gra
A sufficient condition for a regular graph to be class 1
✍ A. J. W. Hilton; Cheng Zhao πŸ“‚ Article πŸ“… 1993 πŸ› John Wiley and Sons 🌐 English βš– 553 KB

## Abstract The core __G__Ξ” of a simple graph __G__ is the subgraph induced by the vertices of maximum degree. It is well known that the Petersen graph is not 1‐factorizable and has property that the core of the graph obtained from it by removing one vertex has maximum degree 2. In this paper, we p