𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Forbidden subgraphs and the existence of a spanning tree without small degree stems

✍ Scribed by Furuya, Michitaka; Tsuchiya, Shoichi

Book ID
120820930
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
442 KB
Volume
313
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Forbidden subgraphs and the existence of
Forbidden subgraphs and the existence of a 2-factor
✍ R. E. L. Aldred; Jun Fujisawa; Akira Saito πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 195 KB πŸ‘ 1 views

## Abstract In this paper, we consider forbidden subgraphs which force the existence of a 2‐factor. Let \documentclass{article}\footskip=0pc\pagestyle{empty}\begin{document}${\cal G}$\end{document} be the class of connected graphs of minimum degree at least two and maximum degree at least three, an

The independence number condition for th
The independence number condition for the existence of a spanning f-tree
✍ Hikoe Enomoto; Kenta Ozeki πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 123 KB πŸ‘ 1 views

## Abstract Let __G__ be a graph and __f__ be a mapping from __V__(__G__) to the positive integers. A subgraph __T__ of __G__ is called an __f__‐tree if __T__ forms a tree and __d__~__T__~(__x__)≀__f__(__x__) for any __x__∈__V__(__T__). We propose a conjecture on the existence of a spanning __f__‐t