The independence polynomial of a graph-a survey VE Levit, E Mandrescu Proceedings of the 1st International Conference on Algebraic Informatics …, 2005 | 197 | 2005 |
On the roots of independence polynomials of almost all very well-covered graphs VE Levit, E Mandrescu Discrete Applied Mathematics 156 (4), 478-491, 2008 | 55 | 2008 |
Independence polynomials of well-covered graphs: generic counterexamples for the unimodality conjecture VE Levit, E Mandrescu European Journal of Combinatorics 27 (6), 931-939, 2006 | 53 | 2006 |
Combinatorial properties of the family of maximum stable sets of a graph VE Levit, E Mandrescu Discrete Applied Mathematics 117 (1-3), 149-161, 2002 | 52 | 2002 |
On well-covered trees with unimodal independence polynomials VE Levit, E Mandrescu Congressus Numerantium, 193-202, 2002 | 47 | 2002 |
On α+-stable König–Egerváry graphs VE Levit, E Mandrescu Discrete Mathematics 263 (1-3), 179-190, 2003 | 44 | 2003 |
Well-covered and König-Egerváry graphs VE Levit, E Mandrescu Congressus Numerantium, 209-218, 1998 | 42 | 1998 |
On unimodality of independence polynomials of some well-covered trees VE Levit, E Mandrescu International Conference on Discrete Mathematics and Theoretical Computer …, 2003 | 41 | 2003 |
Critical independent sets and König–Egerváry graphs VE Levit, E Mandrescu Graphs and Combinatorics 28 (2), 243-250, 2012 | 38 | 2012 |
Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings VE Levit, E Mandrescu Discrete Applied Mathematics 132 (1-3), 163-174, 2003 | 32 | 2003 |
Very well-covered graphs with log-concave independence polynomials VE Levit, E Mandrescu Carpathian Journal of Mathematics, 73-80, 2004 | 29 | 2004 |
On maximum matchings in König–Egerváry graphs VE Levit, E Mandrescu Discrete Applied Mathematics 161 (10-11), 1635-1638, 2013 | 27 | 2013 |
Partial unimodality for independence polynomials of Konig-Egerváry graphs VE Levit, E Mandrescu Congressus Numerantium 179, 109, 2006 | 27 | 2006 |
A family of graphs whose independence polynomials are both palindromic and unimodal VE Levit, E Mandrescu Carpathian Journal of Mathematics, 108-116, 2007 | 25 | 2007 |
Vertices belonging to all critical sets of a graph VE Levit, E Mandrescu SIAM Journal on Discrete Mathematics 26 (1), 399-403, 2012 | 23 | 2012 |
Building graphs whose independence polynomials have only real roots E Mandrescu Graphs and Combinatorics 25 (4), 545-556, 2009 | 23 | 2009 |
Independence polynomials and the unimodality conjecture for very well-covered, quasi-regularizable, and perfect graphs VE Levit, E Mandrescu Graph Theory in Paris: Proceedings of a Conference in Memory of Claude Berge …, 2007 | 23 | 2007 |
A new greedoid: the family of local maximum stable sets of a forest VE Levit, E Mandrescu Discrete Applied Mathematics 124 (1-3), 91-101, 2002 | 22 | 2002 |
A new greedoid: the family of local maximum stable sets of a forest VE Levit, E Mandrescu Discrete Applied Mathematics 124 (1-3), 91-101, 2002 | 22 | 2002 |
Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids VE Levit, E Mandrescu Discrete Applied Mathematics 155 (18), 2414-2425, 2007 | 21 | 2007 |