Chromatic and flow polynomials for directed graphs

DOI10.1006/jctb.1994.1074zbMath0807.05031OpenAlexW2012047944MaRDI QIDQ1338322

J. W. Essam, David K. Arrowsmith

Publication date: 2 March 1995

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jctb.1994.1074

zbMATH Keywords

flow problemsplanar graphsgraph colouringdirected graphschromatic polynomialcolouring problems

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

A bibliography on chromatic polynomials ⋮ Directed Percolation and Generalized Friendly Random Walkers ⋮ Baxter-Guttman-Jensen conjecture for power series in directed percolation problem

This page was built for publication: Chromatic and flow polynomials for directed graphs