Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

On connected factors inK 1,3-free graphs

On connected factors inK 1,3-free graphs A graph is said to beK 1,3-free if it contains noK 1,3 as an induced subgraph. It is shown in this paper that every 2-connectedK 1,3-free graph contains a connected [2,3]-factor. We also obtain that every connectedK 1,3-free graph has a spanning tree with maximum degree at most 3. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Acta Mathematicae Applicatae Sinica Springer Journals

On connected factors inK 1,3-free graphs

Loading next page...
 
/lp/springer-journals/on-connected-factors-ink-1-3-free-graphs-Q5nrg4kmJQ
Publisher
Springer Journals
Copyright
Copyright © 1998 by Science Press
Subject
Mathematics; Applications of Mathematics; Math Applications in Computer Science; Theoretical, Mathematical and Computational Physics
ISSN
0168-9673
eISSN
1618-3932
DOI
10.1007/BF02677347
Publisher site
See Article on Publisher Site

Abstract

A graph is said to beK 1,3-free if it contains noK 1,3 as an induced subgraph. It is shown in this paper that every 2-connectedK 1,3-free graph contains a connected [2,3]-factor. We also obtain that every connectedK 1,3-free graph has a spanning tree with maximum degree at most 3.

Journal

Acta Mathematicae Applicatae SinicaSpringer Journals

Published: Jul 3, 2007

References