Connected even factors in the square of essentially 2-edge-connected graph

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F17%3A43932250" target="_blank" >RIV/49777513:23520/17:43932250 - isvavai.cz</a>
Result on the web
<a href="http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i3p42" target="_blank" >http://www.combinatorics.org/ojs/index.php/eljc/article/view/v24i3p42</a>
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Connected even factors in the square of essentially 2-edge-connected graph
Original language description
An essentially k-edge connected graph G is a connected graph such that deleting less than k edges from G cannot result in two nontrivial components. In this paper we prove that if an essentially 2-edge-connected graph G satisfies that for any pair of leaves at distance 4 in G there exists another leaf of G that has distance 2 to one of them, then the square G^2 has a connected even factor with maximum degree at most 4. Moreover we show that, in general, the square of essentially 2-edge-connected graph does not contain a connected even factor with bounded maximum degree.
Czech name
—
Czech description
—

Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics

Project
<a href="/en/project/GA14-19503S" target="_blank" >GA14-19503S: Graph coloring and structure</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

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

Similar results(10)