Chromatic properties of hamiltonian graphs

被引：4
作者：
Bielak, Halina [1 ]
机构：
[1] UMCS, Inst Math, Lublin, Poland
来源：
DISCRETE MATHEMATICS | 2007年 / 307卷 / 11-12期
关键词：
chromatic polynomials; Hamiltonian graph; Hamiltonian path; zeros of chromatic polynomials;
D O I：
10.1016/j.disc.2005.11.061
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
We study the problem of the location of real zeros of chromatic polynomials for some families of graphs. In particular, a problem presented by Thomassen (see [On the number of hamiltonian cycles in bipartite graphs, Combin. Probab. Comput. 5 (1996) 437-442.]) is discussed and a result for hamiltonian graphs is presented. An open problem is stated for 2-connected graphs with a hamiltonian path. (c) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码：1245 / 1254
页数：10
相关论文
共 50 条
[31]   Hamiltonian paths in distance graphs [J].
V. V. Utkin .
Mathematical Notes, 2015, 97 :919-929
[32]   Hamiltonian-connected graphs [J].
Zhao Kewen ;
Lai, Hong-Jian ;
Zhou, Ju .
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2008, 55 (12) :2707-2714
[33]   ON THE CONSTRUCTION AND ENUMERATION OF HAMILTONIAN GRAPHS [J].
胡冠章 ;
李岷珊 .
Applied Mathematics:A Journal of Chinese Universities, 1993, (01) :25-31
[34]   New sufficient conditions for s-Hamiltonian graphs and s-Hamiltonian connected graphs [J].
Jin, Yan ;
Kewen, Zhao ;
Lai, Hong-Jian ;
Zhou, Ju .
ARS COMBINATORIA, 2008, 88 :217-227
[35]   The Relation Between Hamiltonian and 1-Tough Properties of the Cartesian Product Graphs [J].
Kao, Louis ;
Weng, Chih-wen .
GRAPHS AND COMBINATORICS, 2021, 37 (03) :933-943
[36]   The Relation Between Hamiltonian and 1-Tough Properties of the Cartesian Product Graphs [J].
Louis Kao ;
Chih-wen Weng .
Graphs and Combinatorics, 2021, 37 :933-943
[37]   The most general structure of graphs with hamiltonian or hamiltonian connected square [J].
Ekstein, Jan ;
Fleischner, Herbert .
DISCRETE MATHEMATICS, 2024, 347 (01)
[38]   Biased Expansions of Biased Graphs and Their Chromatic Polynomials [J].
Lori Koban .
Annals of Combinatorics, 2012, 16 :781-788
[39]   An attempt to classify bipartite graphs by chromatic polynomials [J].
Dong, FM ;
Koh, KM ;
Teo, KL ;
Little, CC ;
Hendy, MD .
DISCRETE MATHEMATICS, 2000, 222 (1-3) :73-88
[40]   Biased Expansions of Biased Graphs and Their Chromatic Polynomials [J].
Koban, Lori .
ANNALS OF COMBINATORICS, 2012, 16 (04) :781-788
12345