Flows and generalized coloring theorems in graphs
From MaRDI portal
(Redirected from Publication:1133552)
Cites work
- scientific article; zbMATH DE number 3223737 (Why is no real title available?)
- scientific article; zbMATH DE number 3241107 (Why is no real title available?)
- scientific article; zbMATH DE number 3290993 (Why is no real title available?)
- scientific article; zbMATH DE number 3338381 (Why is no real title available?)
- scientific article; zbMATH DE number 3342868 (Why is no real title available?)
- A Class Of Abelian Groups
- A Contribution to the Theory of Chromatic Polynomials
- A Decomposition for Combinatorial Geometries
- A Theorem on n-Coloring the Points of a Linear Graph
- A theorem on three-coloring the edges of a trivalent graph
- Balanced Valuations and Flows in Multigraphs
- Bounds of the number of disjoint spanning trees
- Decomposition of Finite Graphs Into Forests
- Grötzsch's theorem on 3-colorings
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- Lectures on matroids
- Minimum partition of a matroid into independent subsets
- On the algebraic theory of graph colorings
- The Tutte polynomial
- Universal coefficient theorems for generalized homology and stable cohomotopy
Cited in
(only showing first 100 items - show all)- Short circuit covers for regular matroids with a nowhere zero 5-flow
- A note on shortest cycle covers of cubic graphs
- Additive bases and flows in graphs
- Group connectivity of complementary graphs
- Short Cycle Covers of Cubic Graphs and Intersecting 5-Circuits
- A constructive approach to the critical problem for matroids
- Short cycle covers of graphs with at most 77\% vertices of degree two
- An Eulerian exposition
- Spanning triangle-trees and flows of graphs
- The validity of Tutte's 3-flow conjecture for some Cayley graphs
- Nowhere-zero 3-flows and modulo \(k\)-orientations
- Group flow, complex flow, unit vector flow, and the (2 + )-flow conjecture
- Maximum even factors of graphs
- Graphes de cordes et espaces graphiques
- Graphs with the Circuit Cover Property
- Snarks with given real flow numbers
- The Smallest Classes of Binary and Ternary Matroids Closed under Direct Sums and Complements
- Join of two graphs admits a nowhere-zero \(3\)-flow.
- Circuit double covers of graphs
- Semi-duality and the cycle double cover conjecture
- The Chvátal-Erdős condition for group connectivity in graphs
- Signed cycle double covers
- Coloring cubic graphs by point-intransitive Steiner triple systems
- Antisymmetric flows and strong colourings of oriented graphs
- Integer flows and cycle covers
- Idealness of \(k\)-wise intersecting families
- A note about shortest cycle covers
- Nowhere-zero 3-flows in signed planar graphs
- Covering Multigraphs by Simple Circuits
- Nowhere-zero 15-flow in 3-edge-connected bidirected graphs
- Large even factors of graphs
- Connected \((g,f)\)-factors
- Short cycle covers on cubic graphs by choosing a 2-factor
- Integer 4-flows and cycle covers
- Spanning trees: A survey
- Short cycle covers of cubic graphs
- Fulkerson-covers of hypohamiltonian graphs
- On Tutte polynomials of matroids representable over GF(q)
- Nowhere-zero 3-flows of highly connected graphs
- Matrix choosability
- Connected odd factors of graphs
- Extendability of contractible configurations for nowhere-zero flows and modulo orientations
- Nowhere-zero flows in random graphs
- Trigraphs
- Cycle cover ratio of regular matroids
- Extensions of flow theorems
- Shortest circuit covers of signed graphs
- On the enumeration of chains in regular chain-groups
- Spanning eulerian subgraphs, the splitting lemma, and Petersen's theorem
- The Set of Circular Flow Numbers of Regular Graphs
- Interval matroids and graphs
- 4-edge-connected 4-regular maps on the projective plane
- Zero-sum flows in regular graphs
- Flows and parity subgraphs of graphs with large odd-edge-connectivity
- Nowhere-zero 3-flows in nilpotently vertex-transitive graphs
- Zero-sum flow number of categorical and strong product of 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
- Coloring-flow duality of embedded graphs
- Group connectivity of graphs --- a nonhomogeneous analogue of nowhere-zero flow properties
- Spanning even subgraphs of 3‐edge‐connected graphs
- Zero-sum flow number of octagonal grid and generalized prism
- Flows, view obstructions, and the lonely runner
- Weighted capacitated, priority, and geometric set cover via improved quasi-uniform sampling
- Berge-Fulkerson coloring for some families of superposition snarks
- Nowhere-zero 3-flows in Cayley graphs on generalized dihedral group and generalized quaternion group
- Odd decompositions and coverings of graphs
- Covering weighted graphs by even subgraphs
- Group connectivity under 3‐edge‐connectivity
- On the edge connectivity, Hamiltonicity, and toughness of vertex-transitive graphs
- Flows in 3-edge-connected bidirected graphs
- Note on cycle double covers of graphs
- On Tutte's extension of the four-colour problem
- Idealness of \(k\)-wise intersecting families
- Nowhere-zero 3-flows in abelian Cayley graphs
- Nowhere-zero 6-flows
- NOWHERE-ZERO -FLOWS IN TWO FAMILIES OF VERTEX-TRANSITIVE GRAPHS
- A flow theory for the dichromatic number
- Nearly nowhere-zero \(r\)-flow graphs
- All 4-connected line graphs of claw free graphs are Hamiltonian connected
- Normal 6-edge-colorings of some bridgeless cubic graphs
- Projective, affine, and abelian colorings of cubic graphs
- Shortest coverings of graphs with cycles
- Nowhere-zero integral chains and flows in bidirected graphs
- Signed graphs: from modulo flows to integer-valued flows
- Pósa-condition and nowhere-zero 3-flows
- Graphs with a 3-cycle-2-cover
- Integer flows and modulo orientations of signed graphs
- Is the five-flow conjecture almost false?
- Nowhere-zero integral flows on a bidirected graph
- Flow modules and nowhere-zero flows
- Constant sum flows in regular graphs
- Contractible graphs for flow index less than three
- Superposition and constructions of graphs without nowhere-zero k-flows
- Nowhere-zero 3-flows in Cayley graphs on supersolvable groups
- Improved upper bound on the Frank number of 3-edge-connected graphs
- On the subgraphs of Cayley sum graphs
- A note on antisymmetric flows in graphs
- On vertex-parity edge-colorings
- 3-flows with large support
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)
