Every 4-Connected Graph with Crossing Number 2 is Hamiltonian (Q4561263): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q128892679, #quickstatements; #temporary_batch_1723667127323 |
||
| (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.1137/17m1138443 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2902053870 / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q128892679 / rank | |||
Normal rank | |||
Latest revision as of 21:53, 14 August 2024
scientific article; zbMATH DE number 6989222
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every 4-Connected Graph with Crossing Number 2 is Hamiltonian |
scientific article; zbMATH DE number 6989222 |
Statements
Every 4-Connected Graph with Crossing Number 2 is Hamiltonian (English)
0 references
5 December 2018
0 references
Hamiltonian cycle
0 references
crossing number
0 references
3-cuts
0 references
