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

Kód výsledku v 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>

Výsledek na webu

<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

—

Jazyk výsledku

angličtina

Název v původním jazyce

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

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

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

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

10101 - Pure mathematics

Projekt

<a href="/cs/project/GA14-19503S" target="_blank" >GA14-19503S: Barevnost a struktura grafů</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2017

Kód důvěrnosti údajů

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

Název periodika

ELECTRONIC JOURNAL OF COMBINATORICS

ISSN

1077-8926

e-ISSN

—

Svazek periodika

24

Číslo periodika v rámci svazku

3

Stát vydavatele periodika

AU - Austrálie

Počet stran výsledku

9

Strana od-do

1-9

Kód UT WoS článku

000414864700014

EID výsledku v databázi Scopus

2-s2.0-85029145099