Each maximal planar graph with exactly two separating triangles is Hamiltonian (Q2383540): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2007.03.018 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1966802404 / 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: The Planar Hamiltonian Circuit Problem is NP-Complete / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Planar graphs: Theory and algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3129827 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Theorem on Planar Graphs / rank | |||
Normal rank | |||
Latest revision as of 15:49, 26 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Each maximal planar graph with exactly two separating triangles is Hamiltonian |
scientific article |
Statements
Each maximal planar graph with exactly two separating triangles is Hamiltonian (English)
0 references
19 September 2007
0 references
maximal planar graph
0 references
separating triangle
0 references
Hamilton cycle
0 references
