Chromatic equivalence classes of certain generalized polygon trees
From MaRDI portal
Recommendations
- 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
Cites work
- 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?)
- 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
- The chromaticity of s-bridge graphs and related graphs
- The chromaticity of complete bipartite graphs with at most one edge deleted
Cited in
(13)- Generalized trees and their applications
- Classes of chromatically equivalent graphs and polygon trees
- A bibliography on chromatic polynomials
- On trees of polygons
- On minimum average stretch spanning trees in polygonal 2-trees
- scientific article; zbMATH DE number 2192207 (Why is no real title available?)
- scientific article; zbMATH DE number 528795 (Why is no real title available?)
- Chromatic equivalence classes of certain cycles with edges
- Chromatic polynomials, polygon trees, and outerplanar graphs
- Chromatic equivalence classes of certain generalized polygon trees. III
- The search for chromatically unique graphs. II
- The chromaticity of certain cycles with edges
- Coloring of two families of \(G^s_t(a,b;c,d)\) graphs
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)