Chromatic and flow polynomials for directed graphs

DOI10.1006/JCTB.1994.1074zbMATH Open0807.05031OpenAlexW2012047944MaRDI QIDQ1338322FDOQ1338322

Authors: J. W. Essam, D. 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

Recommendations

• Publication:4934397
• On chromatic and flow polynomial unique graphs
• scientific article; zbMATH DE number 568845
• Chromatic and flow polynomials of generalized vertex join graphs and outerplanar graphs
• scientific article; zbMATH DE number 4095494
• Chromatic polynomials of connected graphs
• A note on flow polynomials of graphs
• Zeros of chromatic and flow polynomials of graphs
• scientific article; zbMATH DE number 833904
• On chordal graphs and their chromatic polynomials

zbMATH Keywords

chromatic polynomialdirected graphsplanar graphsgraph colouringflow problemscolouring problems

Mathematics Subject Classification ID

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

Cited In (9)

• Partition functions and a generalized coloring-flow duality for embedded graphs
• Directed Percolation and Generalized Friendly Random Walkers
• A generalized chromatic polynomial, acyclic orientations with prescribed sources and sinks, and network reliability
• A bibliography on chromatic polynomials
• Combinatorial aspects of an exact sequence that is related to a graphs
• Totally frustrated states in the chromatic theory of gain graphs
• Reciprocity and Polynomial Properties for Even Flows and Potentials on Directed Graphs
• Title not available (Why is that?)
• Baxter-Guttman-Jensen conjecture for power series in directed percolation problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1338322)