The chromatic polynomial of a digraph

DOI10.1007/978-3-030-63072-0_1zbMath1479.05163arXiv1911.09547OpenAlexW2990136770MaRDI QIDQ2056880

Johanna Wiehe, Winfried Hochstättler

Publication date: 8 December 2021

Full work available at URL: https://arxiv.org/abs/1911.09547

zbMATH Keywords

chromatic polynomialflow polynomialdichromatic numberface latticetotally cyclic subdigraphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph polynomials (05C31) Applications of graph theory (05C90) Stochastic network models in operations research (90B15) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

The dichromatic polynomial of a digraph ⋮ Tutte polynomials for regular oriented matroids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The 3 and 4-dichromatic tournaments of minimum order
• Cycle reversions and dichromatic number in tournaments
• The dichromatic number of a digraph
• A flow theory for the dichromatic number
• The NL-flow polynomial
• DICHROMATIC NUMBER AND FRACTIONAL CHROMATIC NUMBER
• Some extremal results in cochromatic and dichromatic theory
• The circular chromatic number of a digraph
• Combinatorial Reciprocity Theorems
• Planar Digraphs of Digirth Four are 2-Colorable
• [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: The chromatic polynomial of a digraph