Computational results and new bounds for the circular flow number of snarks (Q785826): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Colourings of cubic graphs inducing isomorphic monochromatic subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5837978 / rank
 
Normal rank
Property / cites work
 
Property / cites work: House of Graphs: a database of interesting graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generation and properties of snarks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of graphs with circular flow number 5 or more, and the complexity of their recognition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flows and Bisections in Cubic Graphs / 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: Construction of class two graphs with maximum vertex degree three / 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: Balanced Valuations and Flows in Multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular flow number of generalized Blanuša snarks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real flow number and the cycle rank of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Snarks with given real flow numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the strong circular 5‐flow conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular flow numbers of regular multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral decompositions of cubic graphs / 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: Q4294635 / rank
 
Normal rank

Latest revision as of 08:00, 23 July 2024

scientific article
Language Label Description Also known as
English
Computational results and new bounds for the circular flow number of snarks
scientific article

    Statements

    Computational results and new bounds for the circular flow number of snarks (English)
    0 references
    0 references
    0 references
    0 references
    12 August 2020
    0 references
    0 references
    circular flow
    0 references
    cubic graph
    0 references
    bisection
    0 references
    snark
    0 references
    algorithm
    0 references
    dot product
    0 references
    0 references
    0 references