Improved upper bound on the Frank number of 3-edge-connected graphs (Q6201894): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q6177581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity of orientations of 3-edge-connected graphs / 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: Flows and generalized coloring theorems in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nowhere-zero 6-flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the algebraic theory of graph colorings / rank
 
Normal rank

Revision as of 17:02, 28 August 2024

scientific article; zbMATH DE number 7824142
Language Label Description Also known as
English
Improved upper bound on the Frank number of 3-edge-connected graphs
scientific article; zbMATH DE number 7824142

    Statements

    Improved upper bound on the Frank number of 3-edge-connected graphs (English)
    0 references
    0 references
    0 references
    26 March 2024
    0 references
    Frank number
    0 references
    3-edge-connected graph
    0 references

    Identifiers