On chromatic polynomials of regular graphs and modified wheels
Let P(G,y) denote the chromatic polynomial of a graph G expressed in the variable y. A graph G is chromatically unique if P(G,y) = P(H,y) implies that H is isomorphic to G. It is proven that complements of partial matching forest are chromatically unique. An infinite family of counterexamples to the...
Saved in:
Main Author: | |
---|---|
Format: | text |
Language: | English |
Published: |
Animo Repository
1994
|
Subjects: | |
Online Access: | https://animorepository.dlsu.edu.ph/etd_masteral/1550 https://animorepository.dlsu.edu.ph/context/etd_masteral/article/8388/viewcontent/TG02237_F_Redacted.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | De La Salle University |
Language: | English |