Chain polynomials of graphs

Authors:
Ronald C. Read
Affiliations:
Department of Combinatorics and Optimization, University of Waterloo, Ont., Canada N2L 3G1
Venue:
Discrete Mathematics
Year:
2003

Citing 2
Cited 1

Even subgraph expansions for the polynomial of cubic plane maps

Journal of Combinatorial Theory Series B
Chromatic polynomials of homeomorphism classes of graphs

Discrete Mathematics - Special issue on selected papers in honor of Henry W. Gould

Chromatic Roots are Dense in the Whole Complex Plane

Combinatorics, Probability and Computing

Quantified Score

Hi-index	0.05

Visualization

Abstract

The chain polynomial of a graph was introduced in Read and Whitehead (Discrete Math. 204 (1999) 337), and some basic properties of these polynomials were established. In this paper further properties are investigated, partly for their intrinsic interest and partly in order to find ways of computing the chain polynomials of large graphs from those of smaller ones.