The chromatic polynomial of an unlabeled graph

DOI10.1016/0095-8956(85)90068-1zbMath0567.05025OpenAlexW2086575992MaRDI QIDQ1059638

Philip J. Hanlon

Publication date: 1985

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(85)90068-1

zbMATH Keywords

chromatic polynomialacyclic orientationscounting unlabeled acyclic digraphscycle index sum equationsunlabeled graph

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

A bibliography on chromatic polynomials ⋮ The odd-valued chromatic polynomial of a signed graph ⋮ Order polynomials and Pólya's enumeration theorem. ⋮ Combinatorial Hopf algebras from representations of families of wreath products ⋮ Unlabeled signed graph coloring

Cites Work

• Acyclic orientations of graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: The chromatic polynomial of an unlabeled graph