The chromatic polynomial of an unlabeled graph
From MaRDI portal
(Redirected from Publication:1059638)
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
Cites work
Cited in
(10)- Unlabeled signed graph coloring
- Order polynomials and Pólya's enumeration theorem.
- Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations
- The odd-valued chromatic polynomial of a signed graph
- Acyclic orientations of graphs. (Reprint)
- A generalized form of Pòlya's counting method
- A bibliography on chromatic polynomials
- Combinatorial Hopf algebras from representations of families of wreath products
- scientific article; zbMATH DE number 4137783 (Why is no real title available?)
- The chromatic generating function
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)