Hostname: page-component-586b7cd67f-l7hp2 Total loading time: 0 Render date: 2024-11-22T06:00:05.377Z Has data issue: false hasContentIssue false
  • English
  • Français

On the chromatic uniqueness of certain trees of polygons

Part of: Graph theory

Published online by Cambridge University Press:  09 April 2009

Y. H. Peng
Y. H. Peng
Affiliation:
Department of Mathematics, Universiti Pertanian Malaysia, 43400 Serdang, Malaysia
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

We establish a characterization of certain trees of polygons similar to that of n-gon-trees given by Chao and Li.

MSC classification

Secondary: 05C75: Structural characterization of families of graphs 05C15: Coloring of graphs and hypergraphs
Type
Research Article
Information
Journal of the Australian Mathematical Society , Volume 55 , Issue 3 , December 1993 , pp. 403 - 410
Copyright
Copyright © Australian Mathematical Society 1993

References

[1]Chao, C. Y. and Li, N. Z., ‘On trees of polygons’, Arch. Math. 45 (1985), 180–185.CrossRefGoogle Scholar
[2]Chao, C. Y. and Whitehead, E. G. Jr, ‘On the chromatic equivalent of graphs’, in: Theory and applications of graphs, Lecture Notes in Math. 642 (Springer, Berlin, 1978) pp. 121–131.CrossRefGoogle Scholar
[3]Chao, C. Y. and Zhao, L. C., ‘Chromatic polynomials of connected graphs’, Arch. Math. 43 (1984), 187–192.CrossRefGoogle Scholar
[4]Farrell, E. J., ‘On the chromatic coefficients’, Discrete Math. 29 (1980), 257–264.CrossRefGoogle Scholar
[5]Peng, Y. H., ‘On the chromatic coefficients of a bipartite graph’, submitted.Google Scholar
[6]Whitehead, E. G. Jr, ‘Chromatic polynomials of generalized trees’, Discrete Math. 72 (1988), 391–393.CrossRefGoogle Scholar
[7]Whitney, H., ‘The colouring of graphs’, Ann. of Math. 33 (1932), 688–718.CrossRefGoogle Scholar