Circuits of length 5 in 2-factors of cubic graphs (Q432713): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2011.05.026 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2041826321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles Intersecting Edge-Cuts of Prescribed Sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Snarks without small cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular edge-colorings of cubic graphs with girth six / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decompositions and reductions of snarks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of cycles in 2-factors of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873782 / rank
 
Normal rank

Latest revision as of 11:06, 5 July 2024

scientific article
Language Label Description Also known as
English
Circuits of length 5 in 2-factors of cubic graphs
scientific article

    Statements

    Circuits of length 5 in 2-factors of cubic graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 July 2012
    0 references
    0 references
    snark
    0 references
    2-factor
    0 references
    circuit
    0 references
    5-cycle
    0 references
    5-circuit
    0 references
    0 references