The following pages link to (Q3807237):
Displaying 50 items.
- An extremal problem on bigraphic pairs with an \(A\)-connected realization (Q284713) (← links)
- Extendability of contractible configurations for nowhere-zero flows and modulo orientations (Q293640) (← links)
- Characteristic flows on signed graphs and short circuit covers (Q311542) (← links)
- Decompositions of highly connected graphs into paths of any given length (Q324373) (← links)
- A faster test for 4-flow-criticality in snarks (Q324779) (← links)
- Hypohamiltonian snarks have a 5-flow (Q324782) (← links)
- Decompositions of highly connected graphs into paths of length five (Q324786) (← links)
- On even cycle decompositions of 4-regular line graphs (Q383685) (← links)
- \(Z_3\)-connectivity in abelian Cayley graphs (Q389989) (← links)
- Three-matching intersection conjecture for perfect matching polytopes of small dimensions (Q390921) (← links)
- On strongly \(\mathbb{Z}_{2s + 1}\)-connected graphs (Q400521) (← links)
- Graph factors modulo \(k\) (Q402597) (← links)
- The weak 3-flow conjecture and the weak circular flow conjecture (Q412176) (← links)
- Nowhere-zero flows in Cartesian bundles of graphs (Q412278) (← 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)
- Generation and properties of snarks (Q463288) (← links)
- Decomposing a graph into bistars (Q463290) (← links)
- Is the five-flow conjecture almost false? (Q463296) (← links)
- Parity subgraphs with few common edges and nowhere-zero 5-flow (Q497352) (← links)
- A complete characterization of graphic sequences with a \(Z_3\)-connected realization (Q499463) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Pósa-condition and nowhere-zero 3-flows (Q536209) (← links)
- Group connectivity in line graphs (Q641209) (← links)
- \(Z_3\)-connectivity of 4-edge-connected 2-triangular graphs (Q658001) (← links)
- Measures of edge-uncolorability of cubic graphs (Q668025) (← links)
- Postman tours and cycle covers (Q686511) (← links)
- What is on his mind? (Q709300) (← links)
- Nowhere-zero 3-flows in Cayley graphs and Sylow 2-subgroups (Q735403) (← links)
- Group flow, complex flow, unit vector flow, and the \((2 + \epsilon)\)-flow conjecture (Q740648) (← links)
- Maximum degree condition and group connectivity (Q742616) (← links)
- Complexity of planar signed graph homomorphisms to cycles (Q777377) (← links)
- Fano colourings of cubic graphs and the Fulkerson conjecture (Q817779) (← links)
- Group connectivity of graphs with diameter at most 2 (Q820087) (← links)
- The number of nowhere-zero flows on graphs and signed graphs (Q859616) (← links)
- Graphs with a 3-cycle-2-cover (Q897268) (← links)
- On dense strongly \(\mathbb{Z}_{2 s + 1}\)-connected graphs (Q898149) (← links)
- Counting nowhere-zero flows on wheels (Q952677) (← links)
- Smallest counterexample to the 5-flow conjecture has girth at least eleven (Q974466) (← links)
- Every line graph of a 4-edge-connected graph is \(\mathbf Z_3\)-connected (Q1003612) (← links)
- On mod \((2p+1)\)-orientations of graphs (Q1003841) (← links)
- On zero-sum 6-flows of graphs (Q1020938) (← links)
- Edge-decompositions of highly connected graphs into paths (Q1032504) (← links)
- Color-character of uncolorable cubic graphs (Q1036808) (← links)
- Flows, flow-pair covers and cycle double covers (Q1044934) (← links)
- A new invariant of plane bipartite cubic graphs (Q1197024) (← links)
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties (Q1204467) (← links)
- Nowhere-zero 3-flows of highly connected graphs (Q1208358) (← links)
