scholarly journals Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree

2009 ◽  
pp. n/a-n/a
Author(s):  
Suil O ◽  
Douglas B. West
2015 ◽  
Vol 48 ◽  
pp. 49-56
Author(s):  
Guang-Hui Zhang ◽  
Tao-Ming Wang
Keyword(s):  

10.37236/5660 ◽  
2017 ◽  
Vol 24 (4) ◽  
Author(s):  
Arrigo Bonisoli ◽  
Simona Bonvicini

Let $G$ be a connected graph with an even number of edges. We show that if the subgraph of $G$ induced by the vertices of odd degree has a perfect matching, then the line graph of $G$ has a $2$-factor whose connected components are cycles of even length (an even $2$-factor). For a cubic graph $G$, we also give a necessary and sufficient condition so that the corresponding line graph $L(G)$ has an even cycle decomposition of index $3$, i.e., the edge-set of $L(G)$ can be partitioned into three $2$-regular subgraphs whose connected components are cycles of even length. The more general problem of the existence of even cycle decompositions of index $m$ in $2d$-regular graphs is also addressed.


2019 ◽  
Vol 346 ◽  
pp. 523-533
Author(s):  
Carlos Hoppen ◽  
Giovane Mansan

2021 ◽  
Vol 344 (4) ◽  
pp. 112287
Author(s):  
Carlos Hoppen ◽  
Giovane Mansan

2014 ◽  
Vol 80 (1) ◽  
pp. 28-33 ◽  
Author(s):  
Daniel W. Cranston ◽  
Yu-Chang Liang ◽  
Xuding Zhu
Keyword(s):  

2007 ◽  
Vol 307 (21) ◽  
pp. 2453-2463 ◽  
Author(s):  
Hong Yan ◽  
Xiaoqi Yang ◽  
Erfang Shan

2018 ◽  
Vol 38 (2) ◽  
pp. 573 ◽  
Author(s):  
Joanna Cyman ◽  
Magda Dettlaff ◽  
Michael .A. Henning ◽  
Magdalena Lemańska ◽  
Joanna Raczek

Sign in / Sign up

Export Citation Format

Share Document