Generation and properties of snarks (Q463288): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1206.6690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo and strongly pseudo 2-factor isomorphic regular graphs and digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Multigraphs by Simple Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with the Circuit Cover Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Face colorings of embedded graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast generation of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2713660 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Generation of Fullerenes / 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: A survey on snarks and new results: Products, reducibility and a computer search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Special classes of snarks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3937450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On semiextensions and circuit double covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on semiextensions of stable circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3831045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniqueness of maximal dominating cycles in 3‐regular graphs and of hamiltonian cycles in 4‐regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circuit double covers in special types of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note about the dominating circuit conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compatible circuit decompositions of 4‐regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320410 / 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: Circle graphs and the cycle double cover conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Removable circuits in multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double covers of cubic graphs with oddness 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On stable cycles and cycle double covers of graphs with large circumference / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5286666 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducible configurations for the cycle double cover conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On cycle-double covers of graphs of small oddness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Five cycle double covers of some cubic graphs / 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: Q3142415 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Graphic-Minimal Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3722527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3710541 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3807237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5659588 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable dominating circuits in snarks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4677950 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even cycle decompositions of 4-regular graphs and line graphs / 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: Measures of edge-uncolorability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decompositions and reductions of snarks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search for minimal trivalent cycle permutation graphs with girth nine / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the total coloring of certain graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3916595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral decompositions of cubic 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: Q4332881 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle covers (I) - minimal contra pairs and Hamilton weights / rank
 
Normal rank

Latest revision as of 04:49, 9 July 2024

scientific article
Language Label Description Also known as
English
Generation and properties of snarks
scientific article

    Statements

    Generation and properties of snarks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 October 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    snarks
    0 references
    cycle double covers
    0 references
    shortest cycle covers
    0 references
    computer generation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references