Nowhere-zero 3-flows of highly connected graphs (Q1208358): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5422499 / 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: Flows and generalized coloring theorems in graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3807237 / 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: Edge-Disjoint Spanning Trees of Finite Graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5752592 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Problem of Decomposing a Graph into <i>n</i> Connected Factors / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Integer flows / rank | |||
Normal rank |
Latest revision as of 16:14, 17 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Nowhere-zero 3-flows of highly connected graphs |
scientific article |
Statements
Nowhere-zero 3-flows of highly connected graphs (English)
0 references
16 May 1993
0 references
\(k\)-edge-connected graph
0 references
nowhere-zero 3-flow
0 references