Cubic graphs that cannot be covered with four perfect matchings (Q2040017): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3162135753 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2008.01398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treelike snarks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3795706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generation and properties of snarks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on Fouquet-Vanherpes question and Fulkerson conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factorisation of snarks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3766390 / 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: 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: Fulkerson's conjecture and circuit covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039906 / 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: A unified approach to construct snarks with circular flow number 5 / 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: Q5622228 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring of cubic graphs by Steiner triple systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Perfect Matching Coverings and Even Subgraph Coverings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3807237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projective, affine, and abelian colorings of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5799732 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3395507 / 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: Fano colourings of cubic graphs and the Fulkerson conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect Matching Index versus Circular Flow Number of a Cubic Graph / 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: Q4876853 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5659595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of certain types of polyhedra / 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: 1‐Factor and Cycle Covers of Cubic Graphs / rank
 
Normal rank

Latest revision as of 04:14, 26 July 2024

scientific article
Language Label Description Also known as
English
Cubic graphs that cannot be covered with four perfect matchings
scientific article

    Statements

    Cubic graphs that cannot be covered with four perfect matchings (English)
    0 references
    0 references
    0 references
    6 July 2021
    0 references
    0 references
    cubic graph
    0 references
    snark
    0 references
    perfect matching
    0 references
    covering
    0 references
    cycle double cover conjecture
    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