Graph colorings and acyclic orientations
From MaRDI portal
Publication:3768909
DOI10.1080/03081088708817830zbMATH Open0632.05008OpenAlexW1981195564MaRDI QIDQ3768909FDOQ3768909
Authors: Kiem-Phong Vo
Publication date: 1987
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/03081088708817830
Recommendations
- Colorings and orientations of graphs
- Acyclic and oriented chromatic numbers of graphs
- Acyclic coloring of graphs
- Acyclic edge colorings of graphs
- Acyclic edge coloring of graphs
- Orientable edge colorings of graphs
- Colorings and orientations of matrices and graphs
- Acyclic colorings of planar graphs
- Oriented graph coloring
- Acyclic orientations and the chromatic polynomial
Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Coloring of graphs and hypergraphs (05C15)
Cites Work
Cited In (21)
- Complete oriented colourings and the oriented achromatic number
- Acyclic orientations and chromatic generating functions
- Orthogonal colorings of graphs
- The coloring ideal and coloring complex of a graph
- Reciprocal theorems concerning the chromatic polynomial
- The chromatic polynomial of an unlabeled graph
- Acyclic orientations and the chromatic polynomial
- Generating all the acyclic orientations of an undirected graph
- Enumeration of Golomb rulers and acyclic orientations of mixed graphs
- Bijective proofs of two broken circuit theorems
- Acyclic orientations of graphs. (Reprint)
- Colorings and orientations of graphs
- Oriented and injective oriented colourings of grid graphs
- A Matrix for Counting Paths in Acyclic Colored Digraphs
- Bijective proofs of proper coloring theorems
- Acyclic orientation polynomials and the sink theorem for chromatic symmetric functions
- Acyclic orientation polynomials and the sink theorem for chromatic symmetric functions
- Combinatorial reciprocity for the chromatic polynomial and the chromatic symmetric function
- On colorings and orientations of signed graphs
- Graph coloring and monotone functions on posets
- The graph polynomial and the number of proper vertex colorings
This page was built for publication: Graph colorings and acyclic orientations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3768909)