Chromatic invariants for finite graphs: Theme and polynomial variations
- 1 September 1995
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 226-228, 687-722
- https://doi.org/10.1016/0024-3795(95)00248-p
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Spin models for link polynomials, strongly regular graphs and Jaeger’s Higman-Sims modelPacific Journal of Mathematics, 1994
- Graph Invariants Related to Statistical Mechanical Models: Examples and ProblemsJournal of Combinatorial Theory, Series B, 1993
- A note on the star chromatic numberJournal of Graph Theory, 1990
- Generalized k-tuple colorings of cycles and other graphsJournal of Combinatorial Theory, Series B, 1982
- Set colourings of graphsDiscrete Mathematics, 1979
- Orientability of matroidsJournal of Combinatorial Theory, Series B, 1978
- Strongly regular graphsDiscrete Mathematics, 1975
- The chromatic number and other functions of the lexicographic productJournal of Combinatorial Theory, Series B, 1975
- Topology of series-parallel networksJournal of Mathematical Analysis and Applications, 1965
- A Determinant Formula for the Number of Ways of Coloring a MapAnnals of Mathematics, 1912