Graph factors modulo \(k\)

DOI10.1016/J.JCTB.2014.01.002zbMath1300.05262OpenAlexW2044845520WikidataQ56926538 ScholiaQ56926538MaRDI QIDQ402597

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)

Related Items (8)

The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture ⋮ Decomposing graphs into a constant number of locally irregular subgraphs ⋮ The mod k $k$ chromatic index of graphs is O(k) $O(k)$ ⋮ Homomorphisms to small negative even cycles ⋮ Additive Bases and Flows in Graphs ⋮ Factorizing regular graphs ⋮ Unnamed Item ⋮ On \(\{a, b\}\)-edge-weightings of bipartite graphs with odd \(a, b\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The weak 3-flow conjecture and the weak circular flow conjecture
• Nowhere-zero 3-flows and modulo \(k\)-orientations
• Decomposing a graph into bistars
• Regular subgraphs of almost regular graphs
• Group flow, complex flow, unit vector flow, and the \((2 + \epsilon)\)-flow conjecture
• Every 4-regular graph plus an edge contains a 3-regular subgraph
• Edge-decompositions of highly connected graphs into paths
• Circular flows of nearly Eulerian graphs and vertex-splitting
• (2 + ?)-Coloring of planar graphs with large odd-girth
• Claw‐decompositions and tutte‐orientations

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