On the Strongest Form of a Theorem of Whitney for Hamiltonian Cycles in Plane Triangulations (Q2825481): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q4882477 / 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: Q3548359 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Any maximal planar graph with only one separating triangle is Hamiltonian / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Tough graphs and Hamiltonian circuits. / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Hamilton cycles in plane triangulations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A theorem on graphs / rank | |||
Normal rank |
Latest revision as of 18:10, 12 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the Strongest Form of a Theorem of Whitney for Hamiltonian Cycles in Plane Triangulations |
scientific article |
Statements
On the Strongest Form of a Theorem of Whitney for Hamiltonian Cycles in Plane Triangulations (English)
0 references
13 October 2016
0 references
Hamiltonian cycle
0 references
plane triangulation
0 references
maximal planar graph
0 references
decomposition tree
0 references