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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/jgt.3190060415 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2124571105 / rank
 
Normal rank

Latest revision as of 01:07, 20 March 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
    0 references