The Chromatic Polynomial of a Complete Bipartite Graph

DOI10.2307/2318170MaRDI QIDQ3215234zbMATH OpenOpenAlexFDO

Authors J. R. Swenson

Publication date 1973

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2318170

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cited in

(5)

• A bibliography on chromatic polynomials
• Some corollaries of a theorem of Whitney on the chromatic polynomial
• Ferrers graphs, D-permutations, and surjective staircases
• Combinatorial properties of poly-Bernoulli relatives
• Counting with two-level polynomials

This page was built for publication: The Chromatic Polynomial of a Complete Bipartite Graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3215234)