The following pages link to A Class Of Abelian Groups (Q3231211):
Displayed 45 items.
- Bond graphs. III: Bond graphs and electrical networks (Q678853) (← links)
- Counting nowhere-zero flows on wheels (Q952677) (← links)
- Nowhere zero flow and circuit covering in regular matroids (Q1070235) (← links)
- Short circuit covers for regular matroids with a nowhere zero 5-flow (Q1112053) (← links)
- Flows and generalized coloring theorems in graphs (Q1133552) (← links)
- Discrete extremal problems (Q1152306) (← links)
- Nowhere-zero 6-flows (Q1159209) (← links)
- On the enumeration of chains in regular chain-groups (Q1164635) (← links)
- Characterizations of extreme normalized circulations satisfying linear constraints (Q1173097) (← links)
- Integer flows and cycle covers (Q1186130) (← links)
- A combinatorial perspective on algebraic geometry (Q1228515) (← 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)
- Extensions of flow theorems (Q1354719) (← links)
- Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks. (Q1425113) (← links)
- Snarks and flow-snarks constructed from coloring-snarks. (Q1427477) (← links)
- Proofs of two minimum circuit cover conjectures (Q1569041) (← links)
- Superposition and constructions of graphs without nowhere-zero \(k\)-flows (Q1612758) (← links)
- Fixed edge-length graph drawing is NP-hard (Q1813977) (← links)
- Cycle cover ratio of regular matroids (Q1864612) (← links)
- Orthogonal drawings of graphs for the automation of VLSI circuit design (Q1966107) (← links)
- Unimodular modules (Q2433702) (← links)
- Graphes fortement connexes c-minimaux et graphes sans circuit co-minimaux (Q2546207) (← links)
- Decomposition formulas for the flow polynomial (Q2567283) (← links)
- Tension polynomials of graphs (Q3150191) (← links)
- Matroids and Graphs (Q3253061) (← links)
- A conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper bounds (Q3336583) (← links)
- Discrete characterizations of planarity part I: the classical viewpoint (Q3342595) (← links)
- About Counterexamples to The 5-Flow Conjecture (Q3439303) (← links)
- Nowhere-zero -flows on wheels (Q3439571) (← links)
- Integer flows (Q3661623) (← links)
- Computing optimal scalings by parametric network algorithms (Q3691441) (← links)
- Characterizations of optimal scalings of matrices (Q3878655) (← links)
- A sufficient condition for a matrix to be totally unimodular (Q4121911) (← links)
- Graphic matroids and the multicommodity transportation problem (Q4154388) (← links)
- A bibliographic survey of edge‐colorings (Q4192088) (← links)
- Short cycle covers of cubic graphs (Q4284099) (← links)
- Disjoint (<i>s, t</i>)‐cuts in a network (Q4712978) (← links)
- Discrete posets, cell complexes, and the global dimension of tiled orders (Q4868169) (← links)
- Nowhere‐zero 3‐flows in products of graphs (Q5318243) (← links)
- Coloring-flow duality of embedded graphs (Q5461372) (← links)
- Flots et tensions dans un graphe (Q5569395) (← links)
- (Q5579046) (← links)
- Über reguläre Kettengruppen (Q5731398) (← links)
- On the foundations of combinatorial theory I. Theory of M�bius Functions (Q5731810) (← links)