Biased graphs. III: Chromatic and dichromatic invariants
DOI10.1006/jctb.1995.1025zbMath0857.05088OpenAlexW2080817296MaRDI QIDQ1892851
Publication date: 4 July 1995
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/e707496a08effec6c86be527b51ccbeb23b1f011
root systemssupersolvabilitydichromatic polynomialWhitney numbersbiased graphDowling latticesbias matroidbalanced circlesseries-parallel networkdeletion-contraction invariancelift matroidsWhitney number polynomials
Combinatorial aspects of matroids and geometric lattices (05B35) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)
Related Items (20)
This page was built for publication: Biased graphs. III: Chromatic and dichromatic invariants