Two families of chromatically unique graphs.

Two families of chromatically unique graphs.

Let P(G) denote the chromatic polynomial of a graph G. A graph G is said to be chromatically unique if P(G) = P(H) implies that H is isomorphic to G. In this paper, We prove that a graph (resp., a bipartite graph) obtained from K2,4 U P3 (s ≥ 3) (resp., K3,3 U P3 (s ≥ 7)) by identifying the end...

Full description

Bibliographic Details
Main Author: Yee, Hock Peng
Format: Conference or Workshop Item
Language:English
English
Published: 1992
Subjects:
Charts, diagrams, etc.
Mathematics.
Online Access:http://psasir.upm.edu.my/id/eprint/18678/
http://psasir.upm.edu.my/id/eprint/18678/1/ID%2018678.pdf

Similar Items

Similar Items