default search action
Discrete Mathematics, Volume 172
Volume 172, Numbers 1-3, August 1997
- C. C. Chen, Gek Ling Chia, Khee Meng Koh, N. Z. Li, Kee L. Teo:
Preface. 1 - Chong-Yun Chao:
A critically chromatic graph. 3-7 - Chong-Yun Chao, Zhi-Yi Guo, Nian-Zu Li:
On q-graphs. 9-16 - X. E. Chen, K. Z. Ouyang:
Chromatic classes of certain 2-connected (n, n + 2)-graphs homeomorphic to K4. 17-29 - X. E. Chen, K. Z. Ouyang:
Chromatic classes of certain 2-connected (n, n + 2)-graphs II. 31-38 - Gek Ling Chia:
Some problems on chromatic polynomials. 39-44 - Zhi-Yi Guo:
On T-chromatic uniqueness of graphs. 45-51 - Zhi-Yi Guo, Earl Glen Whitehead Jr.:
Chromaticity of a family of K4 homeomorphs. 53-58 - Khee Meng Koh, Kee L. Teo:
The search for chromatically unique graphs - II. 59-78 - Nianzu Li, Xue-Wen Bao, Ru-Ying Liu:
Chromatic uniqueness of the complements of certain forests. 79-84 - Ru-Ying Liu:
Adjoint polynomials and chromatically unique graphs. 85-92 - Zhikang Lu:
The exact value of the harmonious chromatic number of a complete binary tree. 93-101 - Yee-Hock Peng, C. H. C. Little, Kee L. Teo, Hong Wang:
Chromatic equivalence classes of certain generalized polygon trees. 103-114 - José Rodríguez, Appajosyula Satyanarayana:
Chromatic polynomials with least coefficients. 115-119 - A. Sakaloglu, Appajosyula Satyanarayana:
Planar graphs with least chromatic coefficients. 121-130 - Ioan Tomescu:
Maximum chromatic polynomial of 3-chromatic blocks. 131-139 - Douglas R. Woodall:
The largest real zero of the chromatic polynomial. 141-153 - Chengfu Ye, Xuewen Bao:
New families of adjointly unique graphs. 155-162 - Heping Zhang:
The Clar covering polynomial of hexagonal systems with an application to chromatic polynomials. 163-173 - Gek Ling Chia:
A bibliography on chromatic polynomials. 175-191 - Nianzu Li:
The list of chromatically unique graphs of order seven and eight. 193-221
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.