scholarly journals Upper minus total domination in small-degree regular graphs

2007 ◽  
Vol 307 (21) ◽  
pp. 2453-2463 ◽  
Author(s):  
Hong Yan ◽  
Xiaoqi Yang ◽  
Erfang Shan
2019 ◽  
Vol 346 ◽  
pp. 523-533
Author(s):  
Carlos Hoppen ◽  
Giovane Mansan

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

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

2019 ◽  
Vol 46 (2) ◽  
pp. 573-577
Author(s):  
Sharareh Alipour ◽  
Amir Jafari ◽  
Morteza Saghafian

10.37236/1899 ◽  
2005 ◽  
Vol 12 (1) ◽  
Author(s):  
Petteri Kaski ◽  
Patric R. J. Östergård

Algorithms for classifying one-factorizations of regular graphs are studied. The smallest open case is currently graphs of order 12; one-factorizations of $r$-regular graphs of order 12 are here classified for $r\leq 6$ and $r=10,11$. Two different approaches are used for regular graphs of small degree; these proceed one-factor by one-factor and vertex by vertex, respectively. For degree $r=11$, we have one-factorizations of $K_{12}$. These have earlier been classified, but a new approach is presented which views these as certain triple systems on $4n-1$ points and utilizes an approach developed for classifying Steiner triple systems. Some properties of the classified one-factorizations are also tabulated.


Sign in / Sign up

Export Citation Format

Share Document