The roller-coaster conjecture revisited
From MaRDI portal
Publication:1696536
DOI10.1007/s00373-017-1834-zzbMath1380.05153arXiv1612.03736OpenAlexW2563619231WikidataQ122920179 ScholiaQ122920179MaRDI QIDQ1696536
Eugen Mandrescu, Vadim E. Levit
Publication date: 14 February 2018
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.03736
Graph polynomials (05C31) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- On the independence polynomial of the corona of graphs
- Clique cover products and unimodality of independence polynomials
- Maximal-clique partitions and the roller coaster conjecture
- On the unimodality of independence polynomials of some graphs
- Building graphs whose independence polynomials have only real roots
- The roots of the independence polynomial of a clawfree graph
- Independence sequences of well-covered graphs: Non-unimodality and the roller-coaster conjecture
- Roots of independence polynomials of well covered graphs
- Very well covered graphs
- Operations on well-covered graphs and the Roller-Coaster conjecture
- 1-well-covered graphs revisited
- 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 corona of two graphs
- On the independence polynomial of an antiregular graph
- Some Common Properties for Regularizable Graphs, Edge-Critical Graphs and B-Graphs
- On some subclasses of well-covered graphs
- Some covering concepts in graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The roller-coaster conjecture revisited
