Flows and generalized coloring theorems in graphs (Q1133552): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0095-8956(79)90057-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2068987903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Contribution to the Theory of Chromatic Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on n-Coloring the Points of a Linear Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5528475 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algebraic theory of graph colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on three-coloring the edges of a trivalent graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tutte polynomial / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Decomposition for Combinatorial Geometries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5619114 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5572939 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Class Of Abelian Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balanced Valuations and Flows in Multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grötzsch's theorem on 3-colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal coefficient theorems for generalized homology and stable cohomotopy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5512231 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of Finite Graphs Into Forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum partition of a matroid into independent subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds of the number of disjoint spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5615282 / rank
 
Normal rank

Latest revision as of 02:45, 13 June 2024

scientific article
Language Label Description Also known as
English
Flows and generalized coloring theorems in graphs
scientific article

    Statements

    Identifiers