The following pages link to Nowhere-zero 6-flows (Q1159209):
Displaying 50 items.
- Extendability of contractible configurations for nowhere-zero flows and modulo orientations (Q293640) (← links)
- Nowhere-zero 5-flows (Q322188) (← links)
- Hypohamiltonian snarks have a 5-flow (Q324782) (← links)
- A new proof of Seymour's 6-flow theorem (Q345081) (← links)
- Zero-sum magic labelings and null sets of regular graphs (Q405209) (← links)
- A dual version of the brooks group coloring theorem (Q442317) (← links)
- Flows and parity subgraphs of graphs with large odd-edge-connectivity (Q444374) (← links)
- Nearly nowhere-zero \(r\)-flow graphs (Q449109) (← links)
- Nowhere-zero 3-flows and modulo \(k\)-orientations (Q461727) (← links)
- Is the five-flow conjecture almost false? (Q463296) (← links)
- Zero-sum flows of the linear lattice. (Q473085) (← links)
- Parity subgraphs with few common edges and nowhere-zero 5-flow (Q497352) (← links)
- Algebraic flow theory of infinite graphs (Q518176) (← links)
- Intersecting 1-factors and nowhere-zero 5-flows (Q519996) (← links)
- Pósa-condition and nowhere-zero 3-flows (Q536209) (← links)
- Flows in 3-edge-connected bidirected graphs (Q537628) (← links)
- Zero-sum flows in regular graphs (Q605010) (← links)
- Group connectivity in line graphs (Q641209) (← links)
- On bipartite restrictions of binary matroids (Q648977) (← links)
- Measures of edge-uncolorability of cubic graphs (Q668025) (← links)
- Signed cycle double covers (Q668036) (← links)
- Cycle double covers of infinite planar graphs (Q726631) (← links)
- Group flow, complex flow, unit vector flow, and the \((2 + \epsilon)\)-flow conjecture (Q740648) (← links)
- 3-flows with large support (Q777476) (← links)
- Graphes de cordes et espaces graphiques (Q795063) (← links)
- A zero-free interval for flow polynomials of cubic graphs (Q858684) (← links)
- Bounds for the coefficients of flow polynomials (Q875944) (← links)
- Inapproximability of the Tutte polynomial (Q937302) (← links)
- Degree sum and nowhere-zero 3-flows (Q998360) (← links)
- On zero-sum 6-flows of graphs (Q1020938) (← links)
- A note on antisymmetric flows in graphs (Q1041206) (← links)
- Flows, flow-pair covers and cycle double covers (Q1044934) (← links)
- Nowhere-zero integral flows on a bidirected graph (Q1053716) (← links)
- Nowhere zero flow and circuit covering in regular matroids (Q1070235) (← links)
- Nowhere-zero integral chains and flows in bidirected graphs (Q1088883) (← links)
- On Tutte's extension of the four-colour problem (Q1157338) (← links)
- Constructing a covering triangulation by means of a nowhere-zero dual flow (Q1160138) (← links)
- On the enumeration of chains in regular chain-groups (Q1164635) (← links)
- Integer flows and cycle covers (Q1186130) (← links)
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties (Q1204467) (← links)
- A parallel algorithm for approximating the minimum cycle cover (Q1207326) (← links)
- Colorations généralisées, graphes biorientés et deux ou trois choses sur François. (Generalized colourings, digraphs and some things concerning François) (Q1296153) (← links)
- Antisymmetric flows and strong colourings of oriented graphs (Q1296157) (← links)
- On the colorability of \(m\)-composed graphs (Q1336697) (← links)
- Extensions of flow theorems (Q1354719) (← links)
- The construction and reduction of strong snarks (Q1356495) (← links)
- Decomposition of the flow polynomial (Q1359375) (← links)
- Flows, view obstructions, and the lonely runner (Q1386416) (← links)
- Antisymmetric flows and edge-connectivity (Q1422419) (← links)
- Proofs of two minimum circuit cover conjectures (Q1569041) (← links)
