Acyclic orientations of graphs

1973/01/01 by Richard P. Stanley · 26 citations
Mathematics · Computer Science · Engineering · #Advanced Combinatorial Mathematics #Graph Labeling and Dimension Problems #graph theory and CDMA systems

paper · doi:10.1016/0012-365x(73)90108-8

Cited by

• Orientations, lattice polytopes, and group arrangements III: Cartesian product arrangements and applications to the Tutte type polynomials of graphs
• Generalized chromatic polynomials of graphs from Heaps of pieces
• On the Number of Acyclic Orientations of Complete k-Partite Graphs
• Feynman integrals and periods in configuration spaces
• Subgraph posets and graph reconstruction
• Chromatic polynomials of complementary (n,k)-clique pairs
• On the number of forests and connected spanning subgraphs
• Toric partial orders
• Total positivity, Grassmannians, and networks
• Homological combinatorics and extensions of the cd-index
• Enumerating Cyclic Orientations of a Graph
• Monomial Bases for Broken Circuit Complexes
• Enumerating consistent subgraphs of directed acyclic graphs: an insight into biomedical ontologies
• Stapledon Decompositions and Inequalities for Coefficients of Chromatic Polynomials
• Edge colouring models for the Tutte polynomial and related graph invariants
• Combinatorial reciprocity for the chromatic polynomial and the chromatic\n symmetric function
• Set maps, umbral calculus, and the chromatic polynomial
• Combinatorial properties of poly-Bernoulli relatives
• Dual complementary polynomials of graphs and combinatorial interpretation on the values of the Tutte polynomial at positive integers
• Counting Markov Blanket Structures
• A Blass-Sagan bijection on Eulerian equivalence classes
• Power domination polynomials of graphs
• Chromatic polynomials of complements of bipartite graphs
• Acyclic Orientations and Spanning Trees
• New expressions for order polynomials and chromatic polynomials
• More on counting acyclic digraphs