4-connected polyhedra have at least a linear number of Hamiltonian cycles (Q2048366): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q114184727, #quickstatements; #temporary_batch_1712201099914
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejc.2021.103395 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Cycles in 5-connected triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: House of Graphs: a database of interesting graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of hamiltonian cycles in triangulations with few separating triangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedra with few 3-cuts are Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the number of hamiltonian cycles in a maximal planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton cycles in plane triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamilton cycles in certain planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on paths in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Planar Graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJC.2021.103395 / rank
 
Normal rank

Latest revision as of 21:29, 16 December 2024

scientific article
Language Label Description Also known as
English
4-connected polyhedra have at least a linear number of Hamiltonian cycles
scientific article

    Statements

    Identifiers