Flows and generalized coloring theorems in graphs
From MaRDI portal
Publication:1133552
DOI10.1016/0095-8956(79)90057-1zbMATH Open0422.05028OpenAlexW2068987903MaRDI QIDQ1133552FDOQ1133552
Authors: François Jaeger 
Publication date: 1979
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(79)90057-1
Directed graphs (digraphs), tournaments (05C20) Deterministic network models in operations research (90B10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- A Contribution to the Theory of Chromatic Polynomials
- The Tutte polynomial
- Lectures on matroids
- A Decomposition for Combinatorial Geometries
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decomposition of Finite Graphs Into Forests
- On the algebraic theory of graph colorings
- Minimum partition of a matroid into independent subsets
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- Grötzsch's theorem on 3-colorings
- Bounds of the number of disjoint spanning trees
- Title not available (Why is that?)
- A Class Of Abelian Groups
- Title not available (Why is that?)
- Balanced Valuations and Flows in Multigraphs
- A Theorem on n-Coloring the Points of a Linear Graph
- Title not available (Why is that?)
- A theorem on three-coloring the edges of a trivalent graph
- Universal coefficient theorems for generalized homology and stable cohomotopy
Cited In (only showing first 100 items - show all)
- Additive bases and flows in graphs
- Short Cycle Covers of Cubic Graphs and Intersecting 5-Circuits
- Short cycle covers of graphs with at most 77\% vertices of degree two
- Spanning triangle-trees and flows of graphs
- The Smallest Classes of Binary and Ternary Matroids Closed under Direct Sums and Complements
- Join of two graphs admits a nowhere-zero \(3\)-flow.
- Nowhere-zero 3-flows in signed planar graphs
- The Chvátal-Erdős condition for group connectivity in graphs
- Coloring cubic graphs by point-intransitive Steiner triple systems
- A note about shortest cycle covers
- Idealness of \(k\)-wise intersecting families
- Nowhere-zero 15-flow in 3-edge-connected bidirected graphs
- Short cycle covers on cubic graphs by choosing a 2-factor
- Large even factors of graphs
- Integer 4-flows and cycle covers
- Fulkerson-covers of hypohamiltonian graphs
- Connected odd factors of graphs
- Shortest circuit covers of signed graphs
- Extensions of flow theorems
- Nowhere-zero 3-flows in nilpotently vertex-transitive graphs
- 4-edge-connected 4-regular maps on the projective plane
- Interval matroids and graphs
- Zero-sum flow number of categorical and strong product of graphs
- Zero-sum flow number of octagonal grid and generalized prism
- Group connectivity under 3‐edge‐connectivity
- Berge-Fulkerson coloring for some families of superposition snarks
- Odd decompositions and coverings of graphs
- Idealness of \(k\)-wise intersecting families
- A flow theory for the dichromatic number
- Normal 6-edge-colorings of some bridgeless cubic graphs
- Signed graphs: from modulo flows to integer-valued flows
- Integer flows and modulo orientations of signed graphs
- Flow modules and nowhere-zero flows
- Contractible graphs for flow index less than three
- Nowhere-zero 3-flows in Cayley graphs on supersolvable groups
- Improved upper bound on the Frank number of 3-edge-connected graphs
- On 1-sum flows in undirected graphs
- A note on antisymmetric flows in graphs
- On the 4-flow nullity of graphs
- Nowhere-zero 3-flows in matroid base graph
- Decomposing graphs of nonnegative characteristic into subgraphs with degree restrictions
- Multiple weak 2-linkage and its applications on integer flows of signed graphs
- Additive bases and flows in graphs
- Cores, joins and the Fano-flow conjectures
- Small cycle double covers of 4-connected planar graphs
- Flows on signed graphs without long barbells
- Hajós' conjecture and small cycle double covers of planar graphs
- Nowhere-zero 3-flows In Cayley graphs of order \(8p\)
- Circuit decompositions and shortest circuit coverings of hypergraphs
- Nowhere zero flow and circuit covering in regular matroids
- Proofs of two minimum circuit cover conjectures
- Note on integer 4-flows in graphs
- Complementary graphs with flows less than three
- Abelian Colourings of Cubic Graphs
- Circular flows via extended Tutte orientations
- The connectivity of acyclic orientation graphs
- Sketchy tweets: ten minute conjectures in graph theory
- A note on shortest cycle covers of cubic graphs
- Short circuit covers for regular matroids with a nowhere zero 5-flow
- Group connectivity of complementary graphs
- A constructive approach to the critical problem for matroids
- An Eulerian exposition
- The validity of Tutte's 3-flow conjecture for some Cayley graphs
- Nowhere-zero 3-flows and modulo \(k\)-orientations
- Graphs with the Circuit Cover Property
- Circuit double covers of graphs
- Group flow, complex flow, unit vector flow, and the \((2 + \epsilon)\)-flow conjecture
- Snarks with given real flow numbers
- Maximum even factors of graphs
- Graphes de cordes et espaces graphiques
- Semi-duality and the cycle double cover conjecture
- Covering Multigraphs by Simple Circuits
- Signed cycle double covers
- Antisymmetric flows and strong colourings of oriented graphs
- Integer flows and cycle covers
- Connected \((g,f)\)-factors
- Spanning trees: A survey
- Short cycle covers of cubic graphs
- On Tutte polynomials of matroids representable over \(GF(q)\)
- Nowhere-zero 3-flows of highly connected graphs
- Matrix choosability
- Nowhere-zero flows in random graphs
- The Set of Circular Flow Numbers of Regular Graphs
- Cycle cover ratio of regular matroids
- Extendability of contractible configurations for nowhere-zero flows and modulo orientations
- Trigraphs
- On the enumeration of chains in regular chain-groups
- Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem
- Zero-sum flows in regular graphs
- Flows and parity subgraphs of graphs with large odd-edge-connectivity
- Coloring-flow duality of embedded graphs
- Parity subgraphs with few common edges and nowhere-zero 5-flow
- Edge-colourings of cubic graphs admitting a solvable vertex-transitive group of automorphisms
- Spanning even subgraphs of 3‐edge‐connected graphs
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
- Flows, view obstructions, and the lonely runner
- Nowhere-zero 3-flows in Cayley graphs on generalized dihedral group and generalized quaternion group
- On the edge connectivity, Hamiltonicity, and toughness of vertex-transitive graphs
- Covering weighted graphs by even subgraphs
This page was built for publication: Flows and generalized coloring theorems in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1133552)
