A new proof of Wojcicka's conjecture (Q1811074): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q123362783, #quickstatements; #temporary_batch_1706339005099 |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:28, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new proof of Wojcicka's conjecture |
scientific article |
Statements
A new proof of Wojcicka's conjecture (English)
0 references
10 June 2003
0 references
A graph \(G\) is 3-domination-critical if its domination number is 3 and the addition of any edge decreases the domination number by 1. In 1990, \textit{E. Wojcicka} [J. Graph Theory 14, 205-215 (1990; Zbl 0702.05058)] conjectured that every 3-domination-critical graph with minimum degree \(\delta\geq 2\) is Hamiltonian. The authors present a new proof of this conjecture.
0 references
domination-critical graph
0 references
Hamiltonian cycle
0 references
closure operation
0 references
