A new proof of Wojcicka's conjecture
Chen, YJ; Tian, F
AbstractA graph G is 3-domination-critical if its domination number gamma is 3 and the addition of any edge decreases gamma by 1. Wojcicka conjectured that every 3-domination-critical graph with delta greater than or equal to 2 has a hamiltonian cycle (J. Graph Theory 14 (1990) 205-215). The conjecture had been proved and its proof consists of two parts: the case alpha less than or equal to delta + I (J. Graph Theory 25 (1997) 173-184) and the case alpha = delta + 2 (Discrete Appl. Math. 92 (1999) 57-70). In this paper, we give a new and simple proof of the conjecture by using Hanson's (J. Combin. Math. Combin. Comput. 13 (1993) 121-128) and Bondy-Chvatal's (Discrete Math. 15(1976) 111-135) closure operations. (C) 2002 Elsevier Science B.V. All rights reserved.
Keyworddomination-critical graph closure operation Hamiltonian cycle
WOS Research AreaMathematics
WOS SubjectMathematics, Applied
WOS IDWOS:000182966600011
Citation statistics
Document Type期刊论文
Corresponding AuthorChen, YJ
Affiliation1.Nanjing Univ, Dept Math, Nanjing 210093, Peoples R China
2.Chinese Acad Sci, Acad Math & Syst Sci, Inst Syst Sci, Beijing 100080, Peoples R China
Recommended Citation
GB/T 7714
Chen, YJ,Tian, F. A new proof of Wojcicka's conjecture[J]. DISCRETE APPLIED MATHEMATICS,2003,127(3):545-554.
APA Chen, YJ,&Tian, F.(2003).A new proof of Wojcicka's conjecture.DISCRETE APPLIED MATHEMATICS,127(3),545-554.
MLA Chen, YJ,et al."A new proof of Wojcicka's conjecture".DISCRETE APPLIED MATHEMATICS 127.3(2003):545-554.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Chen, YJ]'s Articles
[Tian, F]'s Articles
Baidu academic
Similar articles in Baidu academic
[Chen, YJ]'s Articles
[Tian, F]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Chen, YJ]'s Articles
[Tian, F]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.