|
|||||
|
|
Polynomially determine if a graph is (s,3)-supereulerian |
|
| Institution: | 1. College of Mathematics and System Sciences, Xinjiang University, Urumqi, Xinjiang 830046, China;2. Department of Mathematics, West Virginia University, Morgantown, WV 26506, USA |
| Abstract: | |
| Keywords: | Edge-connectivity Spanning closed trail Supereulerian graphs Polynomial time algorithm |
| 本文献已被 ScienceDirect 等数据库收录！ | |