Premium
Chromatic polynomials, polygon trees, and outerplanar graphs
Author(s) -
Wakelin C. D.,
Woodall D. R.
Publication year - 1992
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.3190160507
Subject(s) - mathematics , combinatorics , chromatic scale , polygon (computer graphics) , outerplanar graph , chromatic polynomial , vertex (graph theory) , 1 planar graph , discrete mathematics , pathwidth , chordal graph , graph , computer science , line graph , telecommunications , frame (networking)
It is proved that all classes of polygon trees are characterized by their chromatic polynomials, and a characterization is given of those polynominals that are chromatic polynomials of outerplanar graphs. The first result yields an alternative proof that outerplanar graphs are recognizable from their vertex‐deleted subgraphs. © 1929 John Wiley & Sons, Inc.