Highly edge-connected factors using given lists on degrees |
| |
| Authors: | Saieed Akbari Morteza Hasanvand Kenta Ozeki |
| |
| Affiliation: | 1. Department of Mathematical Sciences, Sharif University of Technology, Tehran, Iran;2. Yokohama National University, 79-2 Tokiwadai, Hodogaya-ku, Yokohama 240-8501 Japan |
| |
| Abstract: | Let G be a 2k-edge-connected graph with  and let  for every  . A spanning subgraph F of G is called an L-factor, if  for every  . In this article, we show that if  for every  , then G has a k-edge-connected L-factor. We also show that if  and  for every  , then G has a k-edge-connected L-factor. |
| |
| Keywords: | connected -factor connectivity k-edge-connected L-factor regular graph |
|
|
