Connections between the matching and chromatic polynomials

DOI10.1155/S016117129200098XzbMath0799.05053MaRDI QIDQ1205617

Earl Glen jun. Whitehead, E. J. Farrell

Publication date: 1 April 1993

Published in: International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/47005

zbMATH Keywords

matchingchromatic polynomialmatching polynomial

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Enumerative combinatorics (05A99) Graph theory (05C99)

Related Items (10)

Graphs determined by polynomial invariants ⋮ The matching polynomial of a regular graph ⋮ The new methods for constructing matching-equivalence graphs ⋮ The search for chromatically unique graphs. II ⋮ The Clar covering polynomial of hexagonal systems with an application to chromatic polynomials ⋮ A bibliography on chromatic polynomials ⋮ More connections between the matching polynomial and the chromatic polynomial ⋮ A logician's view of graph polynomials ⋮ Chromatic polynomials of complements of bipartite graphs ⋮ Total non-negativity of some combinatorial matrices

This page was built for publication: Connections between the matching and chromatic polynomials