Follow
Eugen Mandrescu
Eugen Mandrescu
Senior lecturer, Computer Science, HIT Israel
Verified email at hit.ac.il
Title
Cited by
Cited by
Year
The independence polynomial of a graph-a survey
VE Levit, E Mandrescu
Proceedings of the 1st International Conference on Algebraic Informatics …, 2005
1962005
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
542008
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
522006
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
522002
On well-covered trees with unimodal independence polynomials
VE Levit, E Mandrescu
Congressus Numerantium, 193-202, 2002
452002
On α+-stable König–Egerváry graphs
VE Levit, E Mandrescu
Discrete Mathematics 263 (1-3), 179-190, 2003
442003
Well-covered and König-Egerváry graphs
VE Levit, E Mandrescu
Congressus Numerantium, 209-218, 1998
421998
On unimodality of independence polynomials of some well-covered trees
VE Levit, E Mandrescu
International Conference on Discrete Mathematics and Theoretical Computer …, 2003
402003
Critical independent sets and König–Egerváry graphs
VE Levit, E Mandrescu
Graphs and Combinatorics 28 (2), 243-250, 2012
382012
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
322003
Very well-covered graphs with log-concave independence polynomials
VE Levit, E Mandrescu
Carpathian Journal of Mathematics, 73-80, 2004
282004
On maximum matchings in König–Egerváry graphs
VE Levit, E Mandrescu
Discrete Applied Mathematics 161 (10-11), 1635-1638, 2013
272013
Partial unimodality for independence polynomials of Konig-Egerváry graphs
VE Levit, E Mandrescu
Congressus Numerantium 179, 109, 2006
272006
A family of graphs whose independence polynomials are both palindromic and unimodal
VE Levit, E Mandrescu
Carpathian Journal of Mathematics, 108-116, 2007
252007
Vertices belonging to all critical sets of a graph
VE Levit, E Mandrescu
SIAM Journal on Discrete Mathematics 26 (1), 399-403, 2012
232012
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
232007
Building graphs whose independence polynomials have only real roots
E Mandrescu
Graphs and Combinatorics 25 (4), 545-556, 2009
222009
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
222002
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
222002
Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids
VE Levit, E Mandrescu
Discrete Applied Mathematics 155 (18), 2414-2425, 2007
212007
The system can't perform the operation now. Try again later.
Articles 1–20