Independence sequences of well-covered graphs: Non-unimodality and the roller-coaster conjecture

DOI10.1007/s00373-002-0515-7zbMath1022.05056OpenAlexW1981895593WikidataQ122944882 ScholiaQ122944882MaRDI QIDQ1409581

William N. Traves, T. S. Michael

Publication date: 16 October 2003

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-002-0515-7

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (11)

Independent set and matching permutations ⋮ Well-covered circulant graphs ⋮ The roller-coaster conjecture revisited ⋮ On the unimodality of independence polynomials of very well-covered graphs ⋮ On the shape of a pure 𝑂-sequence ⋮ Maximal-clique partitions and the roller coaster conjecture ⋮ On the roots of independence polynomials of almost all very well-covered graphs ⋮ Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture ⋮ On the independent set sequence of a tree ⋮ Independence polynomials of circulants with an application to music ⋮ Unimodality of the independence polynomials of some composite graphs

This page was built for publication: Independence sequences of well-covered graphs: Non-unimodality and the roller-coaster conjecture