A planar hypohamiltonian graph with 48 vertices (Q3594955): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Q163156 / rank
Normal rank
 
Property / author
 
Property / author: Tudor I. Zamfirescu / rank
 
Normal rank
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.1002/jgt.20241 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4244752224 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56001743 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar cubic hypohamiltonian and hypotraceable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-connected planar graph without concurrent longest paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On longest paths and circuits in graphs. / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:17, 26 June 2024

scientific article
Language Label Description Also known as
English
A planar hypohamiltonian graph with 48 vertices
scientific article

    Statements

    A planar hypohamiltonian graph with 48 vertices (English)
    0 references
    0 references
    0 references
    9 August 2007
    0 references
    planar
    0 references
    hypohamiltonian
    0 references
    hypotraceable
    0 references
    graph
    0 references

    Identifiers