The chromatic polynomial of an unlabeled graph

DOI10.1016/0095-8956(85)90068-1zbMATH Open0567.05025OpenAlexW2086575992MaRDI QIDQ1059638FDOQ1059638

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

Recommendations

• scientific article; zbMATH DE number 749258
• Publication:3470477
• Unlabeled signed graph coloring
• Inversion of cycle index sum relations for 2- and 3-connected graphs
• scientific article; zbMATH DE number 5237267
• An invariant theory approach to graph enumeration
• Acyclic orientations of graphs. (Reprint)
• The \(\sigma\)-polynomials of unlabeled graphs
• Bijective proofs of two broken circuit theorems
• Graph colorings and acyclic orientations

zbMATH Keywords

chromatic polynomialacyclic orientationscounting unlabeled acyclic digraphscycle index sum equationsunlabeled graph

Mathematics Subject Classification ID

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

Cites Work

• Acyclic orientations of graphs
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (8)

• Unlabeled signed graph coloring
• The odd-valued chromatic polynomial of a signed graph
• A bibliography on chromatic polynomials
• Order polynomials and Pólya's enumeration theorem.
• Title not available (Why is that?)
• The chromatic generating function
• Combinatorial Hopf algebras from representations of families of wreath products
• Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations

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

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