Geodesic
Even factor of bridgeless graphs containing two specified edges
Czechoslovak Mathematical Journal, Tome 68 (2018) no. 4, pp. 1105-1114.

Voir la notice de l'article provenant de la source Czech Digital Mathematics Library

An even factor of a graph is a spanning subgraph in which each vertex has a positive even degree. Let $G$ be a bridgeless simple graph with minimum degree at least $3$. Jackson and Yoshimoto (2007) showed that $G$ has an even factor containing two arbitrary prescribed edges. They also proved that $G$ has an even factor in which each component has order at least four. Moreover, Xiong, Lu and Han (2009) showed that for each pair of edges $e_1$ and $e_2$ of $G$, there is an even factor containing $e_1$ and $e_2$ in which each component containing neither $e_1$ nor $e_2$ has order at least four. In this paper we improve this result and prove that $G$ has an even factor containing $e_1$ and $e_2$ such that each component has order at least four.
DOI : 10.21136/CMJ.2018.0114-17
Classification : 05C70
Keywords: bridgeless graph; components of an even factor; specified edge 
@article{10_21136_CMJ_2018_0114_17,
     author = {Haghparast, Nastaran and Kiani, Dariush},
     title = {Even factor of bridgeless graphs containing two specified edges},
     journal = {Czechoslovak Mathematical Journal},
     pages = {1105--1114},
     publisher = {mathdoc},
     volume = {68},
     number = {4},
     year = {2018},
     doi = {10.21136/CMJ.2018.0114-17},
     mrnumber = {3881900},
     zbl = {07031701},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.21136/CMJ.2018.0114-17/}
}
TY  - JOUR
AU  - Haghparast, Nastaran
AU  - Kiani, Dariush
TI  - Even factor of bridgeless graphs containing two specified edges
JO  - Czechoslovak Mathematical Journal
PY  - 2018
SP  - 1105
EP  - 1114
VL  - 68
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.21136/CMJ.2018.0114-17/
DO  - 10.21136/CMJ.2018.0114-17
LA  - en
ID  - 10_21136_CMJ_2018_0114_17
ER  - 
%0 Journal Article
%A Haghparast, Nastaran
%A Kiani, Dariush
%T Even factor of bridgeless graphs containing two specified edges
%J Czechoslovak Mathematical Journal
%D 2018
%P 1105-1114
%V 68
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.21136/CMJ.2018.0114-17/
%R 10.21136/CMJ.2018.0114-17
%G en
%F 10_21136_CMJ_2018_0114_17
Haghparast, Nastaran; Kiani, Dariush. Even factor of bridgeless graphs containing two specified edges. Czechoslovak Mathematical Journal, Tome 68 (2018) no. 4, pp. 1105-1114. doi : 10.21136/CMJ.2018.0114-17. http://geodesic.mathdoc.fr/articles/10.21136/CMJ.2018.0114-17/

Cité par Sources :