Trees through specified vertices

J. Cutler

doi:10.1016/j.disc.2008.06.032

Trees through specified vertices

J. Cutler

Mathematics

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

We prove a conjecture of Horak that can be thought of as an extension of classical results including Dirac's theorem on the existence of Hamiltonian cycles. Namely, we prove for 1 ≤ k ≤ n - 2 if G is a connected graph with A ⊂ V (G) such that d_G (v) ≥ k for all v ∈ A, then there exists a subtree T of G such that V (T) ⊃ A and d_T (v) ≤ ⌈ frac(n - 1, k) ⌉ for all v ∈ A.

Original language	English
Pages (from-to)	2749-2754
Number of pages	6
Journal	Discrete Mathematics
Volume	309
Issue number	9
DOIs	https://doi.org/10.1016/j.disc.2008.06.032
State	Published - 6 May 2009

Keywords

Subtrees through specified vertices

Access to Document

10.1016/j.disc.2008.06.032

Cite this

@article{83c6b9ebdbd8494f92d3a24017552666,

title = "Trees through specified vertices",

abstract = "We prove a conjecture of Horak that can be thought of as an extension of classical results including Dirac's theorem on the existence of Hamiltonian cycles. Namely, we prove for 1 ≤ k ≤ n - 2 if G is a connected graph with A ⊂ V (G) such that dG (v) ≥ k for all v ∈ A, then there exists a subtree T of G such that V (T) ⊃ A and dT (v) ≤ ⌈ frac(n - 1, k) ⌉ for all v ∈ A.",

keywords = "Subtrees through specified vertices",

author = "J. Cutler",

year = "2009",

month = may,

day = "6",

doi = "10.1016/j.disc.2008.06.032",

language = "English",

volume = "309",

pages = "2749--2754",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "9",

}

TY - JOUR

T1 - Trees through specified vertices

AU - Cutler, J.

PY - 2009/5/6

Y1 - 2009/5/6

N2 - We prove a conjecture of Horak that can be thought of as an extension of classical results including Dirac's theorem on the existence of Hamiltonian cycles. Namely, we prove for 1 ≤ k ≤ n - 2 if G is a connected graph with A ⊂ V (G) such that dG (v) ≥ k for all v ∈ A, then there exists a subtree T of G such that V (T) ⊃ A and dT (v) ≤ ⌈ frac(n - 1, k) ⌉ for all v ∈ A.

AB - We prove a conjecture of Horak that can be thought of as an extension of classical results including Dirac's theorem on the existence of Hamiltonian cycles. Namely, we prove for 1 ≤ k ≤ n - 2 if G is a connected graph with A ⊂ V (G) such that dG (v) ≥ k for all v ∈ A, then there exists a subtree T of G such that V (T) ⊃ A and dT (v) ≤ ⌈ frac(n - 1, k) ⌉ for all v ∈ A.

KW - Subtrees through specified vertices

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

U2 - 10.1016/j.disc.2008.06.032

DO - 10.1016/j.disc.2008.06.032

M3 - Article

AN - SCOPUS:67349272020

SN - 0012-365X

VL - 309

SP - 2749

EP - 2754

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 9

ER -

Trees through specified vertices

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this