Forbidden subgraphs and the existence of spanning k-trees

Katsuhiro Ota, Takeshi Sugiyama

Research output: Contribution to journalArticle

Abstract

A k-tree of a graph is a subtree with maximum degree at most k. Though forbidden subgraphs are a major tool to find a hamiltonian cycle or a hamiltonian path, there are only a few results using the condition on forbidden subgraphs to find a spanning k-tree for k<3. In this paper, we give a sufficient condition using the condition on forbidden subgraphs for a graph G to have a spanning k-tree.

Original languageEnglish
Pages (from-to)3506-3511
Number of pages6
JournalDiscrete Mathematics
Volume310
Issue number24
DOIs
Publication statusPublished - 2010 Dec 28

Fingerprint

K-tree
Forbidden Subgraph
Hamiltonians
Hamiltonian path
Hamiltonian circuit
Graph in graph theory
Maximum Degree
Sufficient Conditions

Keywords

  • Forbidden subgraph
  • k-tree

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Forbidden subgraphs and the existence of spanning k-trees. / Ota, Katsuhiro; Sugiyama, Takeshi.

In: Discrete Mathematics, Vol. 310, No. 24, 28.12.2010, p. 3506-3511.

Research output: Contribution to journalArticle

Ota, Katsuhiro ; Sugiyama, Takeshi. / Forbidden subgraphs and the existence of spanning k-trees. In: Discrete Mathematics. 2010 ; Vol. 310, No. 24. pp. 3506-3511.
@article{4c7f148028624ecebb10afcb123bdfe0,
title = "Forbidden subgraphs and the existence of spanning k-trees",
abstract = "A k-tree of a graph is a subtree with maximum degree at most k. Though forbidden subgraphs are a major tool to find a hamiltonian cycle or a hamiltonian path, there are only a few results using the condition on forbidden subgraphs to find a spanning k-tree for k<3. In this paper, we give a sufficient condition using the condition on forbidden subgraphs for a graph G to have a spanning k-tree.",
keywords = "Forbidden subgraph, k-tree",
author = "Katsuhiro Ota and Takeshi Sugiyama",
year = "2010",
month = "12",
day = "28",
doi = "10.1016/j.disc.2010.08.015",
language = "English",
volume = "310",
pages = "3506--3511",
journal = "Discrete Mathematics",
issn = "0012-365X",
publisher = "Elsevier",
number = "24",

}

TY - JOUR

T1 - Forbidden subgraphs and the existence of spanning k-trees

AU - Ota, Katsuhiro

AU - Sugiyama, Takeshi

PY - 2010/12/28

Y1 - 2010/12/28

N2 - A k-tree of a graph is a subtree with maximum degree at most k. Though forbidden subgraphs are a major tool to find a hamiltonian cycle or a hamiltonian path, there are only a few results using the condition on forbidden subgraphs to find a spanning k-tree for k<3. In this paper, we give a sufficient condition using the condition on forbidden subgraphs for a graph G to have a spanning k-tree.

AB - A k-tree of a graph is a subtree with maximum degree at most k. Though forbidden subgraphs are a major tool to find a hamiltonian cycle or a hamiltonian path, there are only a few results using the condition on forbidden subgraphs to find a spanning k-tree for k<3. In this paper, we give a sufficient condition using the condition on forbidden subgraphs for a graph G to have a spanning k-tree.

KW - Forbidden subgraph

KW - k-tree

UR - http://www.scopus.com/inward/record.url?scp=77958016183&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77958016183&partnerID=8YFLogxK

U2 - 10.1016/j.disc.2010.08.015

DO - 10.1016/j.disc.2010.08.015

M3 - Article

AN - SCOPUS:77958016183

VL - 310

SP - 3506

EP - 3511

JO - Discrete Mathematics

JF - Discrete Mathematics

SN - 0012-365X

IS - 24

ER -