The weak 3-flow conjecture and the weak circular flow conjecture
From MaRDI portal
Publication:412176
DOI10.1016/J.JCTB.2011.09.003zbMATH Open1239.05083OpenAlexW1964553741WikidataQ56926585 ScholiaQ56926585MaRDI QIDQ412176FDOQ412176
Authors: Carsten Thomassen
Publication date: 4 May 2012
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.2011.09.003
Recommendations
- An equivalent version of the 3-flow conjecture
- Strong 3‐Flow Conjecture for projective planar graphs
- The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture
- Tutte's 3-flow conjecture and short cycle covers
- Two strong 3-flow theorems for planar graphs
- On the strong circular 5‐flow conjecture
- The validity of Tutte's 3-flow conjecture for some Cayley graphs
- Tutte's 3-flow conjecture and matchings in bipartite graphs
- The complexity of the zero-sum 3-flows
Cites Work
- Graph theory
- Graphs on surfaces
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Edge-decompositions of highly connected graphs into paths
- Decomposing graphs into paths of fixed length
- Decompositions of highly connected graphs into paths of length 3
- Graph Decomposition is NP-Complete: A Complete Proof of Holyer's Conjecture
- Claw‐decompositions and tutte‐orientations
Cited In (87)
- Decomposing graphs into paths and trees
- A note on an extremal problem for group-connectivity
- Circular flows in planar graphs
- Spanning triangle-trees and flows of graphs
- Equivalent versions of group-connectivity theorems and conjectures
- \(Z_3\)-connectivity of wreath product of graphs
- Nowhere-zero 3-flows and modulo \(k\)-orientations
- Group flow, complex flow, unit vector flow, and the \((2 + \epsilon)\)-flow conjecture
- Modulo 5-orientations and degree sequences
- Factorizing regular graphs
- Circular flow number of highly edge connected signed graphs
- Packing spanning trees in highly essentially connected graphs
- Strong 3‐Flow Conjecture for projective planar graphs
- Decomposing graphs into a constant number of locally irregular subgraphs
- Counterexamples to Jaeger's circular flow conjecture
- Title not available (Why is that?)
- Nowhere-zero 3-flows in toroidal graphs
- Vector flows and integer flows
- Extendability of contractible configurations for nowhere-zero flows and modulo orientations
- Nowhere-zero 3-flows and \(Z_3\)-connectivity of graphs without two forbidden subgraphs
- The flow index and strongly connected orientations
- On strongly \(\mathbb{Z}_{2s + 1}\)-connected graphs
- Random 4-regular graphs have 3-star decompositions asymptotically almost surely
- 3-Flows and Combs
- Nowhere-zero 3-flows of claw-free graphs
- On the additive bases problem in finite fields
- Nowhere-zero 3-flows in Cayley graphs on generalized dihedral group and generalized quaternion group
- NOWHERE-ZERO -FLOWS IN TWO FAMILIES OF VERTEX-TRANSITIVE GRAPHS
- Two strong 3-flow theorems for planar graphs
- Fractional coloring planar graphs under Steinberg-type conditions
- Two equivalent properties of \(\mathcal Z_3\)-connectivity
- Decompositions of highly connected graphs into paths of length five
- The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture
- Star decomposition of graphs
- Decomposing highly edge-connected graphs into paths of any given length
- Graph factors modulo \(k\)
- Edge-decomposition of graphs into copies of a tree with four edges
- Decomposing a graph into bistars
- On dense strongly \(\mathbb{Z}_{2 s + 1}\)-connected graphs
- Mod \((2p+1)\)-orientation on bipartite graphs and complementary graphs
- Degree sum of a pair of independent edges and \(Z_{3}\)-connectivity
- Modulo orientations with bounded independence number
- Group Connectivity, Strongly Z_m-Connectivity, and Edge Disjoint Spanning Trees
- Degree sum of 3 independent vertices and \(Z_3\)-connectivity
- Strongly 2-connected orientations of graphs
- On the subgraphs of Cayley sum graphs
- Modulo orientations and matchings in graphs
- Decomposing highly edge-connected graphs into homomorphic copies of a fixed tree
- An equivalent version of the 3-flow conjecture
- Nowhere-zero 3-flows in Cayley graphs of order \(pq^2\)
- Additive bases and flows in graphs
- On star decompositions of random regular graphs
- \(Z_3\)-connectivity of claw-free graphs
- Nowhere-zero 3-flow of graphs with small independence number
- Decomposing highly connected graphs into paths of length five
- Nowhere-zero 3-flows in semistrong product of graphs
- Orientations of infinite graphs with prescribed edge-connectivity
- Flow polynomials as Feynman amplitudes and their \(\alpha\)-representation
- Edge-partitioning 3-edge-connected graphs into paths
- Star Partitions of Perfect Graphs
- Algebraic flow theory of infinite graphs
- A proof of the Barát-Thomassen conjecture
- Decomposing graphs into paths of fixed length
- Additive bases and flows in graphs
- The existence of planar 4-connected essentially 6-edge-connected graphs with no claw-decompositions
- Thin trees in some families of distance-regular graphs
- Nowhere-zero 3-flows in signed planar graphs
- Edge‐decomposing graphs into coprime forests
- Group connectivity in \(J_3\) line graphs
- Nowhere-zero 3-flows in nilpotently vertex-transitive graphs
- Group connectivity under 3‐edge‐connectivity
- Exponentially many \(\mathbb{Z}_5\)-colorings in simple planar graphs
- Flow-contractible configurations and group connectivity of signed graphs
- Signed graphs: from modulo flows to integer-valued flows
- Integer flows and modulo orientations of signed graphs
- Modulo orientations with bounded out-degrees
- Flow modules and nowhere-zero flows
- Contractible graphs for flow index less than three
- Nowhere-zero 3-flows in Cayley graphs on supersolvable groups
- Homomorphisms to small negative even cycles
- A cube dismantling problem related to bootstrap percolation
- On the 4-flow nullity of graphs
- Flows on signed graphs without long barbells
- Nowhere-zero 3-flows In Cayley graphs of order \(8p\)
- Flow extensions and group connectivity with applications
- Complementary graphs with flows less than three
- Circular flows via extended Tutte orientations
This page was built for publication: The weak 3-flow conjecture and the weak circular flow conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q412176)