Tutte polynomials for directed graphs
Authors:
- Jordan AwanJAJordan Awan
- Olivier BernardiOBOlivier Bernardi
- 1 January 2020
- journal article
- research article
- Published by Elsevier in Journal of Combinatorial Theory, Series B
- Vol. 140, 192-247
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- National Science Foundation
This publication has 25 references indexed in Scilit:
- Convolution–multiplication identities for Tutte polynomials of graphs and matroidsJournal of Combinatorial Theory, Series B, 2010
- On distinguishing trees by their chromatic symmetric functionsJournal of Combinatorial Theory, Series A, 2008
- Scheduling Problems and Mixed Graph ColoringsOptimization, 2002
- A weighted graph polynomial from chromatic invariants of knotsAnnales de l'institut Fourier, 1999
- Graph colorings and related symmetric functions: ideas and applications A description of results, interesting applications, & notable open problemsDiscrete Mathematics, 1998
- On the Cover Polynomial of a DigraphJournal of Combinatorial Theory, Series B, 1995
- A Symmetric Function Generalization of the Chromatic Polynomial of a GraphAdvances in Mathematics, 1995
- Generalized activities and the tutte polynomialDiscrete Mathematics, 1990
- Convexity in oriented matroidsJournal of Combinatorial Theory, Series B, 1980
- On the random-cluster modelPhysica, 1972