Odd factors of a graph |
| |
| Authors: | Jerzy Topp Preben D Vestergaard |
| |
| Affiliation: | 1. Faculty of Applied Physics and Mathematics, Technical University of Gdańsk, Majakowskiego 11/12, 80-952, Gdańsk, Poland
2. Department of Mathematics and Computer Science, Aalborg University, Frederik Bajers Vej 7, DK-9220, Aalborg, Denmark
|
| |
| Abstract: | LetG be a graph and letf be a function defined on V(G) such that f(x) is a positive odd integer for everyx ? V(G). A spanning subgraphF ofG is called a l,f]-odd factor of G if dF(x) ? {1,3,2026, f(x)} for every x ?V(G), whered F (x) denotes the degree of x inF. We discuss several conditions for a graphG to have a 1,f]-odd factor. |
| |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
