The odd-even invariant for graphs
The odd-even invariant for graphs is the graphic version of the odd-even invariant for oriented matroids. Here, simple properties of this invariant are verified, and for certain graphs, including chordal graphs and complete bipartite graphs, its value is determined. The odd-even chromatic polynomial...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article (Journal) |
| Language: | English |
| Published: |
November 2015
|
| In: |
European journal of combinatorics
Year: 2015, Volume: 50, Pages: 87-96 |
| DOI: | 10.1016/j.ejc.2015.03.023 |
| Online Access: | Verlag, Volltext: http://dx.doi.org/10.1016/j.ejc.2015.03.023 Verlag, Volltext: http://www.sciencedirect.com/science/article/pii/S0195669815000840 
|
| Author Notes: | Richard Eager, Jim Lawrence |
| Summary: | The odd-even invariant for graphs is the graphic version of the odd-even invariant for oriented matroids. Here, simple properties of this invariant are verified, and for certain graphs, including chordal graphs and complete bipartite graphs, its value is determined. The odd-even chromatic polynomial is introduced, its coefficients are briefly studied, and it is shown that the absolute value of this polynomial at −1 equals the odd-even invariant, in analogy with the usual chromatic polynomial and the number of acyclic orientations. |
|---|---|
| Item Description: | Available online: 25 April 2015 Gesehen am 22.03.2018 |
| Physical Description: | Online Resource |
| DOI: | 10.1016/j.ejc.2015.03.023 |