Dominating cycles in regular 3-connected graphs (Q1193714): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0012-365x(92)90051-g / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1983571890 / rank | |||
Normal rank | |||
Latest revision as of 08:56, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Dominating cycles in regular 3-connected graphs |
scientific article |
Statements
Dominating cycles in regular 3-connected graphs (English)
0 references
27 September 1992
0 references
The authors conjecture that every 3-connected, \(k\)-regular graph on at most \(4k\) vertices is Hamiltonian for \(k\geq 4\). They prove the weaker statement that every longest cycle is dominating provided \(k\geq 63\).
0 references
dominating cycles
0 references
regular 3-connected graphs
0 references
Hamiltonian
0 references
