A cubic 3-connected graph having no cycle through given 10 vertices has the “Petersen form” (Q3960873): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
RedirectionBot (talk | contribs)
Changed an Item
Property / author
 
Property / author: Alexander K. Kelmans / rank
 
Normal rank
Property / author
 
Property / author: Michael V. Lomonosov / rank
 
Normal rank

Revision as of 16:01, 28 February 2024

scientific article
Language Label Description Also known as
English
A cubic 3-connected graph having no cycle through given 10 vertices has the “Petersen form”
scientific article

    Statements

    A cubic 3-connected graph having no cycle through given 10 vertices has the “Petersen form” (English)
    0 references
    1982
    0 references
    cubic 3-connected graph
    0 references
    Petersen graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references