Opuscula Mathematica
Opuscula Math. 30, no. 2 (), 123-131
Opuscula Mathematica

On chromatic equivalence of a pair of K4-homeomorphs

Abstract. Let \(P(G, \lambda)\) be the chromatic polynomial of a graph \(G\). Two graphs \(G\) and \(H\) are said to be chromatically equivalent, denoted \(G \sim H\), if \(P(G, \lambda) = P(H, \lambda)\). We write \([G] = \{H| H \sim G\}\). If \([G] = \{G\}\), then \(G\) is said to be chromatically unique. In this paper, we discuss a chromatically equivalent pair of graphs in one family of \(K_4\)-homeomorphs, \(K_4(1, 2, 8, d, e, f)\). The obtained result can be extended in the study of chromatic equivalence classes of \(K_4(1, 2, 8, d, e, f)\) and chromatic uniqueness of \(K_4\)-homeomorphs with girth \(11\).
Keywords: chromatic polynomial, chromatic equivalence, \(K_4\)-homeomorphs.
Mathematics Subject Classification: 05C15.
Cite this article as:
S. Catada-Ghimire, H. Roslan, Y. H. Peng, On chromatic equivalence of a pair of K4-homeomorphs, Opuscula Math. 30, no. 2 (2010), 123-131, http://dx.doi.org/10.7494/OpMath.2010.30.2.123
Download this article's citation as:
a .bib file (BibTeX), a .ris file (RefMan), a .enw file (EndNote)
or export to RefWorks.

RSS Feed

horizontal rule

ISSN 1232−9274, e-ISSN 2300−6919, DOI https://doi.org/10.7494/OpMath
Copyright © 2003−2017 OPUSCULA MATHEMATICA
Contact: opuscula@agh.edu.pl
Made by Tomasz Zabawa

horizontal rule

In accordance with EU legislation we advise you this website uses cookies to allow us to see how the site is used. All data is anonymized.
All recent versions of popular browsers give users a level of control over cookies. Users can set their browsers to accept or reject all, or certain, cookies.