Chromatic uniqueness of certain tripartite graphs identified with a path / G.C. Lau and Y.H. Peng

• Autores principales: Lau, G.C (Autor), Peng, Y.H (Autor)
• Formato: Libro
• Publicado: 2004.
• Materias: Conference or Workshop Item; PeerReviewed
• Acceso en línea: Link Metadata

For a graph G, let P (G) be its chromatic polynomial. Two graphs G and H are chromatically equivalent if P(G) = P(H). A graph G is chromatically unique if P(H) = P(G) implies that H == G. In this paper, we classify the chromatic classes of graphs obtained from K2,2,2 u Pm (m ≥ 3) (respectively, (K2,...