Circular flows of nearly Eulerian graphs and vertex-splitting (Q3150192): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the star chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: On (k,d)-colorings and fractional nowhere-zero flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: High-girth graphs avoiding a minor are nearly bipartite / rank
 
Normal rank
Property / cites work
 
Property / cites work: The chromatic numbers of graph bundles over cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: (2 + ?)-Coloring of planar graphs with large odd-girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Reduction Method for Edge-Connectivity in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Imbedding of Linear Graphs in Surfaces / 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: Star chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: 4-chromatic projective graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular chromatic number: A survey / rank
 
Normal rank

Latest revision as of 17:36, 4 June 2024

scientific article
Language Label Description Also known as
English
Circular flows of nearly Eulerian graphs and vertex-splitting
scientific article

    Statements

    Circular flows of nearly Eulerian graphs and vertex-splitting (English)
    0 references
    0 references
    0 references
    1 February 2003
    0 references
    0 references
    0 references
    0 references
    0 references
    circular flow
    0 references
    nearly Eulerian graphs
    0 references
    vertex splitting
    0 references
    integer flow
    0 references
    0 references