A Class Of Abelian Groups
From MaRDI portal
Publication:3231211
DOI10.4153/CJM-1956-004-9zbMath0070.02302MaRDI QIDQ3231211
Publication date: 1956
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Related Items
Short cycle covers of cubic graphs, Disjoint (s, t)‐cuts in a network, Discrete posets, cell complexes, and the global dimension of tiled orders, Nowhere‐zero 3‐flows in products of graphs, Unnamed Item, Coloring-flow duality of embedded graphs, Flots et tensions dans un graphe, Über reguläre Kettengruppen, [https://portal.mardi4nfdi.de/wiki/Software:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions], Bond graphs. III: Bond graphs and electrical networks, Counting nowhere-zero flows on wheels, Nowhere zero flow and circuit covering in regular matroids, Short circuit covers for regular matroids with a nowhere zero 5-flow, Flows and generalized coloring theorems in graphs, Discrete extremal problems, Nowhere-zero 6-flows, On the enumeration of chains in regular chain-groups, Characterizations of extreme normalized circulations satisfying linear constraints, Integer flows and cycle covers, A combinatorial perspective on algebraic geometry, 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), Antisymmetric flows and strong colourings of oriented graphs, Extensions of flow theorems, Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks., Snarks and flow-snarks constructed from coloring-snarks., Proofs of two minimum circuit cover conjectures, Superposition and constructions of graphs without nowhere-zero \(k\)-flows, Fixed edge-length graph drawing is NP-hard, Cycle cover ratio of regular matroids, Orthogonal drawings of graphs for the automation of VLSI circuit design, Unimodular modules, Graphes fortement connexes c-minimaux et graphes sans circuit co-minimaux, Decomposition formulas for the flow polynomial, Tension polynomials of graphs, A conforming decomposition theorem, a piecewise linear theorem of the alternative, and scalings of matrices satisfying lower and upper bounds, Discrete characterizations of planarity part I: the classical viewpoint, Matroids and Graphs, About Counterexamples to The 5-Flow Conjecture, Nowhere-zero -flows on wheels, Integer flows, Computing optimal scalings by parametric network algorithms, Characterizations of optimal scalings of matrices, A sufficient condition for a matrix to be totally unimodular, Graphic matroids and the multicommodity transportation problem, A bibliographic survey of edge‐colorings
