Star subdivisions and connected even factors in the square of a graph

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

Result language
angličtina
Original language name
Star subdivisions and connected even factors in the square of a graph
Original language description
For any positive integer s, a [2, 2s]-factor in a graph G is a connected even factor with maximum degree at most 2s. We prove that if every induced S(K_{1;2s+1}) in a graph G has at least 3 edges in a block of degree at most two, then G^2 has a [2, 2s]-factor. This extends the results of Hendry and Vogler and of Abderrezzak et. al. et al. in [5,1].
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
<a href="/en/project/1M0545" target="_blank" >1M0545: Institute for Theoretical Computer Science</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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)