Chromatic uniqueness of certain tripartite graphs identified with a path / G.C. Lau and Y.H. Peng
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,...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Published: |
2004.
|
| Subjects: | |
| Online Access: | Link Metadata |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Internet
Link Metadata3rd Floor Main Library
| Call Number: |
A1234.567 |
|---|---|
| Copy 1 | Available |