Graph factors modulo k

Journal of Combinatorial Theory, Series B - Tập 106 - Trang 174-177 - 2014
Carsten Thomassen1,2
1Department of Applied Mathematics and Computer Science, Technical University of Denmark, DK-2800 Lyngby, Denmark
2King Abdulaziz University, Jeddah, Saudi Arabia

Tài liệu tham khảo

Alon, 1984, Regular subgraphs of almost regular graphs, J. Combin. Theory Ser. B, 37, 79, 10.1016/0095-8956(84)90047-9 Alon, 1984, Every 4-regular graph plus an edge contains a 3-regular subgraph, J. Combin. Theory Ser. B, 37, 92, 10.1016/0095-8956(84)90048-0 Bárat, 2006, Claw-decompositions and Tutte-orientations, J. Graph Theory, 52, 135, 10.1002/jgt.20149 Bondy, 1976 Diestel, 1997 Jaeger, 1982, On circular flows in graphs, Proc. Colloq. Math. János Bolyai, 37, 391 Jaeger, 1988, Nowhere-zero flow problems, 71 Klostermeyer, 2000, (2+ϵ)-coloring of planar graphs with large girth, J. Graph Theory, 33, 109, 10.1002/(SICI)1097-0118(200002)33:2<109::AID-JGT5>3.0.CO;2-F Lovász, 2013, Nowhere-zero 3-flows and modulo k-orientations, J. Combin. Theory Ser. B, 103, 587, 10.1016/j.jctb.2013.06.003 Mohar, 2001 Thomassen, 2008, Edge-decompositions of highly connected graphs into paths of length 4, Abh. Math. Sem. Univ. Hamburg, 78, 17, 10.1007/s12188-008-0002-z Thomassen, 2012, The weak 3-flow conjecture and the weak circular flow conjecture, J. Combin. Theory Ser. B, 102, 521, 10.1016/j.jctb.2011.09.003 Thomassen, 2013, Decomposing a graph into bistars, J. Combin. Theory Ser. B, 103, 504, 10.1016/j.jctb.2013.05.003 C. Thomassen, Group flow, complex flow, unit vector flow, and the (2+ϵ)-flow conjecture, submitted for publication. Zhang, 1997 Zhang, 2002, Circular flows of nearly Eulerian graphs and vertex-splitting, J. Graph Theory, 40, 147, 10.1002/jgt.10040