Graph factors modulo k

DOI10.1016/J.JCTB.2014.01.002MaRDI QIDQ402597zbMATH OpenOpenAlexWikidataFDO

Authors Carsten Thomassen

Publication date 28 August 2014

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jctb.2014.01.002

zbMATH Keywords

graph factors modulo \(k\)

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• \(k\) -factors in regular graphs
• Factors and factorization of graphs
• On graph decompositions modulo \(k\)
• scientific article; zbMATH DE number 1283862
• scientific article; zbMATH DE number 874568
• K_^--factors in graphs
• scientific article; zbMATH DE number 5064167
• scientific article; zbMATH DE number 1792633
• scientific article; zbMATH DE number 700639
• Fractional k-factors of graphs

Cites work

• (2 + ?)-Coloring of planar graphs with large odd-girth
• Circular flows of nearly Eulerian graphs and vertex-splitting
• Claw‐decompositions and tutte‐orientations
• Decomposing a graph into bistars
• Edge-decompositions of highly connected graphs into paths
• Every 4-regular graph plus an edge contains a 3-regular subgraph
• Graph theory with applications
• Graphs on surfaces
• Group flow, complex flow, unit vector flow, and the (2 + )-flow conjecture
• scientific article; zbMATH DE number 3904637 (Why is no real title available?)
• scientific article; zbMATH DE number 4075098 (Why is no real title available?)
• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• Regular subgraphs of almost regular graphs
• The weak 3-flow conjecture and the weak circular flow conjecture

Cited in

(12)

• On graph decompositions modulo \(k\)
• On \(\{a, b\}\)-edge-weightings of bipartite graphs with odd \(a, b\)
• Equitable factorizations of edge-connected graphs
• Factorizing regular graphs
• The 3-flow conjecture, factors modulo k, and the 1-2-3-conjecture
• Decomposing graphs into a constant number of locally irregular subgraphs
• Additive bases and flows in graphs
• The Erdős-Gallai theorem modulo \(k\)
• The mod k k chromatic index of graphs is O(k) O(k)
• Homomorphisms to small negative even cycles
• Modulo factors with bounded degrees
• On the mod k chromatic index of graphs

This page was built for publication: Graph factors modulo \(k\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q402597)