A new proof of Wojcicka's conjecture (Q1811074)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new proof of Wojcicka's conjecture |
scientific article; zbMATH DE number 1925257
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new proof of Wojcicka's conjecture |
scientific article; zbMATH DE number 1925257 |
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
0.9081159830093384
0 references
0.8919997811317444
0 references
0.8919997215270996
0 references
