A Dirac theorem for trestles

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F12%3A43914948" target="_blank" >RIV/49777513:23520/12:43914948 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1016/j.disc.2012.03.011" target="_blank" >http://dx.doi.org/10.1016/j.disc.2012.03.011</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1016/j.disc.2012.03.011" target="_blank" >10.1016/j.disc.2012.03.011</a>

Result language
angličtina
Original language name
A Dirac theorem for trestles
Original language description
A k-subtrestle in a graph G is a 2-connected subgraph of G of maximum degree at most k. We prove a lower bound on the order of a largest k- subtrestle of G, in terms of k and the minimum degree of G. A corollary of our result is that every 2-connected graph with n vertices and minimum degree at least 2n/(k + 2) contains a spanning k-subtrestle. This corollary is an extension of Dirac's Theorem.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—

Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)