1‐Factor and Cycle Covers of Cubic Graphs (Q4982281): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Covering Multigraphs by Simple Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest coverings of graphs with cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generation and properties of snarks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fulkerson's conjecture and circuit covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blocking and anti-blocking pairs of polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Snarks without small cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short cycle covers of graphs and nowhere-zero flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equivalence of two conjectures of Berge and Fulkerson / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Multi-Colourings of Cubic Graphs, and Conjectures of Fulkerson and Tutte / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification and characterizations of snarks / rank
 
Normal rank

Latest revision as of 22:00, 9 July 2024

scientific article; zbMATH DE number 6418967
Language Label Description Also known as
English
1‐Factor and Cycle Covers of Cubic Graphs
scientific article; zbMATH DE number 6418967

    Statements

    1‐Factor and Cycle Covers of Cubic Graphs (English)
    0 references
    0 references
    24 March 2015
    0 references
    cycle covers
    0 references
    cubic graphs
    0 references
    1-factors
    0 references
    Berge-Fulkerson conjecture
    0 references
    conjecture of Fan and Raspaud
    0 references
    5-cycle double cover conjecture
    0 references

    Identifiers