Graph factors modulo k
From MaRDI portal
Publication:402597
DOI10.1016/J.JCTB.2014.01.002zbMATH Open1300.05262OpenAlexW2044845520WikidataQ56926538 ScholiaQ56926538MaRDI QIDQ402597FDOQ402597
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
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_\ell^-\)-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
- Graphs on surfaces
- Graph theory with applications
- Nowhere-zero 3-flows and modulo \(k\)-orientations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The weak 3-flow conjecture and the weak circular flow conjecture
- Edge-decompositions of highly connected graphs into paths
- Decomposing a graph into bistars
- Claw‐decompositions and tutte‐orientations
- Regular subgraphs of almost regular graphs
- Circular flows of nearly Eulerian graphs and vertex-splitting
- (2 + ?)-Coloring of planar graphs with large odd-girth
- 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
Cited In (9)
- Additive bases and flows in graphs
- The Erdős-Gallai theorem modulo \(k\)
- Factorizing regular graphs
- Decomposing graphs into a constant number of locally irregular subgraphs
- The mod k $k$ chromatic index of graphs is O(k) $O(k)$
- Equitable factorizations of edge-connected graphs
- The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture
- Homomorphisms to small negative even cycles
- On \(\{a, b\}\)-edge-weightings of bipartite graphs with odd \(a, b\)
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)
