Longest cycles in 3-connected cubic graphs (Q1074598): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Trees in Polyhedral Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest Cycles in 2-Connected Graphs with Prescribed Maximum Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest Cycles in 3-Connected 3-Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Longest Simple Paths in Polyhedral Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortness exponents of families of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A shortness exponent forr-regularr-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5563928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamiltonian Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5557756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5599566 / rank
 
Normal rank

Latest revision as of 13:45, 17 June 2024

scientific article
Language Label Description Also known as
English
Longest cycles in 3-connected cubic graphs
scientific article

    Statements

    Longest cycles in 3-connected cubic graphs (English)
    0 references
    0 references
    1986
    0 references
    See the preview in Zbl 0568.05034.
    0 references
    0 references
    3-connected cubic graph
    0 references
    cycle
    0 references
    0 references
    0 references