Flows and generalized coloring theorems in graphs
type: Item
instance of: scholarly article
title: Flows and generalized coloring theorems in graphs
zbMATH Open document ID: 0422.05028
DOI: 10.1016/0095-8956(79)90057-1
author: François Jaeger
published in: Journal of Combinatorial Theory. Series B
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 90B10
zbMATH DE Number: 3655968
zbMATH Keywords: flows
zbMATH Keywords: graph coloring
MaRDI profile type: Publication
full work available at URL: 0095-8956(79)90057-1
OpenAlex ID: W2068987903
cites work: A Contribution to the Theory of Chromatic Polynomials
cites work: A Theorem on n-Coloring the Points of a Linear Graph
cites work: Q5528475
cites work: On the algebraic theory of graph colorings
cites work: A theorem on three-coloring the edges of a trivalent graph
cites work: The Tutte polynomial
cites work: A Decomposition for Combinatorial Geometries
cites work: Q5619114
cites work: Q5572939
cites work: A Class Of Abelian Groups
cites work: Lectures on matroids
cites work: Balanced Valuations and Flows in Multigraphs
cites work: Grötzsch's theorem on 3-colorings
cites work: Universal coefficient theorems for generalized homology and stable cohomotopy
cites work: Q5512231
cites work: Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
cites work: Decomposition of Finite Graphs Into Forests
cites work: Minimum partition of a matroid into independent subsets
cites work: Bounds of the number of disjoint spanning trees
cites work: Q5615282
description: scientific article; zbMATH DE number 3655968