Antisymmetric flows and edge-connectivity (Q1422419): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
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: On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs / 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: Antisymmetric flows and strong colourings of oriented graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Good and semi-strong colorings of oriented planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE TWO-COLOURING OF HYPERGRAPHS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nowhere-zero 6-flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871752 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antisymmetric flows and strong oriented coloring of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344206 / 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: On the Problem of Decomposing a Graph into <i>n</i> Connected Factors / rank
 
Normal rank

Latest revision as of 15:01, 6 June 2024

scientific article
Language Label Description Also known as
English
Antisymmetric flows and edge-connectivity
scientific article

    Statements