Some snarks are worse than others (Q6181999): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Treelike snarks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Multigraphs by Simple Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generation and properties of snarks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4407444 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal ear decompositions of matching covered graphs and bases for the matching lattice / 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: Measures of edge-uncolorability of cubic graphs / 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: On (k,d)-colorings and fractional nowhere-zero flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational results and new bounds for the circular flow number of snarks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction of permutation snarks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über simpliziale Zerfällungen beliebiger (endlicher oder unendlicher) Graphen / 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: Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short cycle covers and the cycle double cover conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Cycle Covers of Graphs with Minimum Degree Three / rank
 
Normal rank
Property / cites work
 
Property / cites work: On essentially 4-edge-connected cubic bricks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching structure and the matching lattice / 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: Cubic graphs that cannot be covered with four perfect matchings / 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: Edge colorings and circular flows on regular 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: On Tutte's extension of the four-colour problem / 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: A Contribution to the Theory of Chromatic Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring problems / rank
 
Normal rank

Latest revision as of 19:47, 23 August 2024

scientific article; zbMATH DE number 7793129
Language Label Description Also known as
English
Some snarks are worse than others
scientific article; zbMATH DE number 7793129

    Statements

    Some snarks are worse than others (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 January 2024
    0 references
    bridgeless cubic graph
    0 references
    perfect matchings
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers