Chromatic polynomials, polygon trees, and outerplanar graphs
From MaRDI portal
Publication:4020704
DOI10.1002/jgt.3190160507zbMath0778.05074OpenAlexW2071225534MaRDI QIDQ4020704
C. D. Wakelin, Douglas R. Woodall
Publication date: 17 January 1993
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190160507
Trees (05C05) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)
Related Items (9)
Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs ⋮ The search for chromatically unique graphs. II ⋮ The largest real zero of the chromatic polynomial ⋮ A bibliography on chromatic polynomials ⋮ Unnamed Item ⋮ Chromaticity of series-parallel graphs ⋮ On planar and non-planar graphs having no chromatic zeros in the interval(1,2) ⋮ Patterns in Khovanov link and chromatic graph homology ⋮ Chromatically unique 6-bridge graph theta(a,a,a,b,b,c)
This page was built for publication: Chromatic polynomials, polygon trees, and outerplanar graphs
