Petersen Cores and the Oddness of Cubic Graphs (Q2958201): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Decomposition of snarks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fulkerson's conjecture and circuit covers / 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: On snarks that are far from being 3-edge colorable / 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: Sparsely intersecting perfect matchings in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decompositions and reductions of snarks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification and characterizations of snarks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersecting 1-factors and nowhere-zero 5-flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: 1‐Factor and Cycle Covers of Cubic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Girths of bipartite sextet graphs / rank
 
Normal rank

Latest revision as of 09:25, 13 July 2024

scientific article
Language Label Description Also known as
English
Petersen Cores and the Oddness of Cubic Graphs
scientific article

    Statements

    Petersen Cores and the Oddness of Cubic Graphs (English)
    0 references
    0 references
    0 references
    0 references
    1 February 2017
    0 references
    0 references
    cubic graphs
    0 references
    snarks
    0 references
    perfect matchings
    0 references
    covers
    0 references
    oddness
    0 references
    0 references
    0 references