An equivalent formulation of the Fan-Raspaud Conjecture and related problems (Q3298120): 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: W3038140730 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1811.08363 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treelike snarks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424771 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponentially many perfect matchings in cubic graphs / 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: 2-factor Hamiltonian graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Petersen-colorings and some families of snarks / rank
 
Normal rank
Property / cites work
 
Property / cites work: S_12 and P_12-colorings of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3807237 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Petersen Cores and the Oddness of Cubic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3424884 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perfect matchings with restricted intersection in cubic graphs / 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: Three matching intersection property for matching covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / 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: Sparsely intersecting perfect matchings in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering a cubic graph with perfect matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unique Fulkerson coloring of Petersen minor-free cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A remark on Petersen coloring conjecture of Jaeger / rank
 
Normal rank
Property / cites work
 
Property / cites work: On two consequences of Berge–Fulkerson conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2857439 / 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:09, 23 July 2024

scientific article
Language Label Description Also known as
English
An equivalent formulation of the Fan-Raspaud Conjecture and related problems
scientific article

    Statements

    An equivalent formulation of the Fan-Raspaud Conjecture and related problems (English)
    0 references
    0 references
    0 references
    21 July 2020
    0 references
    0 references
    cubic graph
    0 references
    perfect matching
    0 references
    oddness
    0 references
    Fan-Raspaud conjecture
    0 references
    Berge-Fulkerson conjecture
    0 references
    Petersen colouring
    0 references
    0 references
    0 references
    0 references