Live briefing
Everything about Nowhere-zero flow
Concept in graph theory
In graph theory, a nowhere-zero flow or NZ flow is a network flow that is nowhere zero. It is intimately connected to coloring planar graphs. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Nowhere-zero flowA 5-minute orientation
- Skim a recent paper: Nowhere-zero 3-flows in Cayley graphs of order pq2Influential work since 2022
- Pick up a classic book: Quantitative graph theoryThe most-reprinted book on the subject
- Read the landmark paper: Nowhere-zero 6-flowsCited 169 times
- Go sideways: Graph coloringA closely related topic
- Go sideways: Tait's conjectureA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Nowhere-zero 6-flows
Group connectivity of graphs—A nonhomogeneous analogue of nowhere-zero flow properties
Nowhere-zero 3-flows and modulo k-orientations
Nowhere-zero integral flows on a bidirected graph
Nowhere-zero 3-flows in triangularly connected graphs
Nowhere‐zero 3‐flows in locally connected graphs
Ore Condition and Nowhere-Zero 3-Flows
Degree sum and nowhere-zero 3-flows
🆕 Influential since 2022
📚 Books worth reading
- 📕Quantitative graph theoryMatthias Dehmer, Frank Emmert-Streib · 2014
The Conspirators HierarchyJohn Coleman · 1992
100 songsBob Dylan · 2017- 📕Counting Methods for Nowhere-Zero FlowsMartin Kochol · 2011
Gravity Of Frustration · 2021
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Graph coloring In graph theory, graph coloring is a methodic assignment of labels traditionally called "colors" to elements of a graph. The assignment is subject to certain…
- Tait's conjecture In mathematics, Tait's conjecture states that "Every 3-connected planar cubic graph has a Hamiltonian cycle (along the edges) through all its vertices"…
- Edge coloring In graph theory, a proper edge coloring of a graph is an assignment of "colors" to the edges of the graph so that no two incident edges have the same color…
- Snark (graph theory) In the mathematical field of graph theory, a snark is an undirected graph with exactly three edges per vertex whose edges cannot be colored with only three…
- Vizing's theorem In graph theory, Vizing's theorem states that every simple undirected graph may be edge colored using a number of colors that is at most one larger than…
- Cycle double cover In graph-theoretic mathematics, a cycle double cover is a collection of cycles in an undirected graph that together include each edge of the graph exactly…
- Chromatic polynomial The chromatic polynomial is a graph polynomial studied in algebraic graph theory, a branch of mathematics. It counts the number of graph colorings as a…
- Dual graph In the mathematical discipline of graph theory, the dual graph of a planar graph G is a graph that has a vertex for each face of G. The dual graph has…