Chromatic equivalence classes of certain generalized polygon trees
The graphs considered in this paper are generalized polygon trees with three interior regions, which can be defined non-recursively as follows: the graph \(G^s_t(a,b;c,d)\) has at most 4 vertices \(u\), \(v\), \(w\), \(x\), the are two disjoint paths of lengths \(d\geq 2\) and \(c\geq d\) joining \(u\) and \(v\), and of lengths \(b\geq 2\) and \(a\geq b\) joining \(w\) and \(x\), one of length \(s\geq 0\) joining \(u\) and \(w\) (if \(s=0\) then \(u=w\)) and one of length \(t\geq 0\) joining \(v\) and \(x\) (if \(t=0\) then \(v=x\)). Let \(C_r(a,b;c,d)\) be the family \(\{G^s_t(a,b; c,d)\mid r=s+t, s\geq 0, t\geq 0\}\). Two graphs are called chromatically equivalent if they have the same chromatic polynomial. Several referenced papers give necessary and sufficient conditions for \(C_r(a,b; c,d)\) to be a chromatic equivalence class for fixed values of some of the parameters \(r\), \(a\), \(b\), \(c\), \(d\), and in [\((*)\) \textit{Y.-H. Peng}, Another family of chromatically unique graphs, Graphs Comb. 11, No. 3, 285-295 (1995; Zbl 0836.05028)] it is shown that \(G^0_1(a,b; c,d)\) is in a chromatic class by itself if \(\min\{a,b,c,d\}\geq 4\). The paper under review presents several sufficient conditions for \(C_r(a,b; c,d)\) to be a chromatic equivalence class, of which the following two are proved: \(\min\{a,b, c,d\}\geq r+3\geq 4\) (from which the result of \((*)\) is derived as a corollary) and \(r\geq a\geq b+3\geq c+ 6\geq d+9\).
- The chromaticity of certain cycles with edges
- Chromatic equivalence classes of certain generalized polygon trees. III
- Coloring of two families of G^s_t(a,b;c,d) graphs
- scientific article; zbMATH DE number 2197936
- Chromatic equivalence classes of certain cycles with edges
- Chromaticity of series-parallel graphs
- Classes of chromatically equivalent graphs and polygon trees
- On the chromatic equivalence class of graphs
- scientific article; zbMATH DE number 4089574
- Generalized trees and their applications
- An introduction to chromatic polynomials
- Another family of chromatically unique graphs
- Chromatic classes of certain 2-connected \((n,n+2)\)-graphs. II
- Classes of chromatically equivalent graphs and polygon trees
- scientific article; zbMATH DE number 3961645 (Why is no real title available?)
- scientific article; zbMATH DE number 4089545 (Why is no real title available?)
- scientific article; zbMATH DE number 54779 (Why is no real title available?)
- scientific article; zbMATH DE number 3050594 (Why is no real title available?)
- The chromaticity of s-bridge graphs and related graphs
- The chromaticity of complete bipartite graphs with at most one edge deleted
- On trees of polygons
- Classes of chromatically equivalent graphs and polygon trees
- The search for chromatically unique graphs. II
- A bibliography on chromatic polynomials
- Chromatic equivalence classes of certain generalized polygon trees. III
- On minimum average stretch spanning trees in polygonal 2-trees
- Generalized trees and their applications
- Coloring of two families of G^s_t(a,b;c,d) graphs
- The chromaticity of certain cycles with edges
- Chromatic polynomials, polygon trees, and outerplanar graphs
- scientific article; zbMATH DE number 528795 (Why is no real title available?)
- scientific article; zbMATH DE number 2192207 (Why is no real title available?)
- Chromatic equivalence classes of certain cycles with edges
This page was built for publication: Chromatic equivalence classes of certain generalized polygon trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1366783)
