
E. Mandrescu, Strongly perfect products of graphs
Czechoslovak Math. J. 41(116), 1991 (368372)

E. Olaru, E. Mandrescu, Sstrongly perfect Cartesian products of graphs
J. of Graph Theory 16, 1992 (297305)

V.E. Levit, E. Mandrescu, On stable graphs
Congressus Numerantium 124, 1997 (3346)

E. Olaru, E. Mandrescu, G. Alexe, Strongly perfect tensor product of graphs
Revue Roumaine de Math. Pures et Appliquées 43, 1998 (627639)

V. E. Levit, E. Mandrescu, On hereditary properties of composition graphs
Discussiones Mathematicae – Graph Theory 18, 1998 (183195)

V. E. Levit, E. Mandrescu, Wellcovered and KönigEgervary graphs
Congressus Numerantium 130, 1998 (209218)

V. E. Levit, E. Mandrescu, Wellcovered trees
Congressus Numerantium 139, 1999 (101112)

V. E. Levit, E. Mandrescu, On ++stable graphs
Congressus Numerantium 142, 2000 (207219)

V. E. Levit, E. Mandrescu, On the structure of stable graphs
Discrete Mathematics 236, 2001 (227243)

V. E. Levit, E. Mandrescu, Combinatorial properties of the family of maximum stable sets of a graph,
Discrete Applied Mathematics 117, 2002 (149161)

V. E. Levit, E. Mandrescu, A new Greedoid: the family of local maximum stable sets of a forest,
Discrete Applied Mathematics 124, 2002 (91101)

V.E. Levit, E. Mandrescu, On wellcovered trees with unimodal independence
Polynomials, Congressus Numerantium 159, 2002 (193202)

V. E. Levit, E. Mandrescu, A family of wellcovered graphs with unimodal independence polynomials,
Congressus Numerantium 165, 2003 (195207)

V. E. Levit, E. Mandrescu, On +stable König
Egerváry graphs Discrete Mathematics 263, 2003 (179190)

V. E. Levit, E. Mandrescu, Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings,
Discrete Applied Mathematics 132, 2004 (163174)

V. E. Levit, E. Mandrescu, Graph products with logconcave independence polynomials
WSEAS Trans. on Mathematics, 3(3), 2004 (487493)

V. E. Levit, E. Mandrescu, Very wellcovered graphs with logconcave independence
Polynomials, Carpathian J. of Mathematics 20(1), 2004 (7380)

V. E. Levit, E. Mandrescu, Some operations preserving logconcavity of nonnegative
functions, Mathematical Inequalities and Applications, 9(1) 2006 (6373)

V. E. Levit, E. Mandrescu, Independence polynomials of wellcovered graphs:
Generic counterexamples for the unimodality conjecture,
European J. of Combinatorics, 27, 2006 (931939)

V. E. Levit, E. Mandrescu, On critical edges in KönigEgerváry graphs
Discrete Mathematics, 306, 2006 (16841693)

V.E. Levit, E. Mandrescu, Independence polynomials and the unimodality conjecture for very wellcovered, quasiregularizable, and perfect graphs,
Graph Theory – Trends in Mathematics, 2006 (243254) Birkhauser Verlag Basel/Switzerland

V. E. Levit, E. Mandrescu, Partial unimodality of the independence polynomial for
KönigEgerváry graphs, Congressus Numerantium 179, 2006 (109119)

V. E. Levit, E. Mandrescu, A family of graphs whose independence polynomials are both palindromic and unimodal,
Carpathian J. of Mathematics, 23(12), 2007 (108116)

V.E. Levit, E. Mandrescu, Matrices and stable bipartite graphs,
J. of Universal Computer Science 13(11), 2007 (16921706)

V. E. Levit, E. Mandrescu, Trianglefree graphs with uniquely restricted maximum
matchings and their corresponding greedoids, Discrete App Math, 155, 2007 (24142425)

V. E. Levit, E. Mandrescu, On the roots of independence polynomials of almost all very wellcovered graphs,
Special issue honoring Peter Hammer
Discrete Applied Mathematics 156, 2008 (478491)

V.E. Levit, E. Mandrescu, The intersection of all maximum stable sets of a tree and its pendant vertices,
Discrete Mathematics, 308, 2008 (5809–5814)

V. E. Levit, E. Mandrescu, Some structural properties of very wellcovered graphs
Congressus Numerantium, 186, 2007 (97106)

V. E. Levit, E. Mandrescu, Graph operations and partial unimodality of independence polynomials,
Congressus Numerantium, 190, 2008 (2131)

V.E. Levit, E. Mandrescu, Greedoids on vertex sets of unicycle graphs
Congressus Numerantium, 197, 2009 (183191)

E. Mandrescu, Building graphs whose independence polynomials have only real roots
Graphs and Combinatorics, 25, 2009 (545556)

V.E. Levit, E. Mandrescu, Graph operations that are good for greedoids
Discrete Applied Mathematics, 158, 2010 (14181423)

V.E. Levit, E. Mandrescu, A simple proof of an inequality connecting the alternating number of independent sets and the decycling number
Discrete Mathematics, 311, 2011 (12041206)

V.E. Levit, E. Mandrescu, Graphs with Fsymmetric independence polynomials
Acta Universitatis Apulensis 2011 (185194)

E. Mandrescu, I. Mirică
Forests whose independence polynomials are palindromic and have only real roots
J. of Advanced Mathematical Studies, 4(2), 2011 (4150)

E. Mandrescu, I. Mirică, Independence polynomials of some graphs with extremal Fibonacci index, "Vasile Alecsandri" University of Bacău,
Scientific Studies and Research Series Mathematics and Informatics, 21(1), 2011 (127138)

V.E. Levit, E. Mandrescu, On symmetry of independence polynomials
Symmetry, 3, 2011 (472486)

V.E. Levit, E. Mandrescu, Very wellcovered graphs of girth at least four and local maximum stable set greedoids
Discrete Mathematics, Algorithms and Applications, 3(2), 2011 (245252)

V.E. Levit, E. Mandrescu, A characterization of KönigEgerváry graphs using a common property of all maximum matchings
Electronic Notes in Discrete Mathematics, 38, 2011 (565570)

V.E. Levit, E. Mandrescu, Critical independent sets and KönigEgerváry graphs
Graphs and Combinatorics, 28, 2012 (243250)

V.E. Levit, E. Mandrescu, The cyclomatic number of a graph and its independence polynomial at 1,
Graphs and Combinatorics, 29, 2013 (259273)

V.E. Levit, E. Mandrescu, On local maximum stable set greedoids
Discrete Mathematics, 31, 2012 (588596)

V.E. Levit, E. Mandrescu, Vertices belonging to all critical sets of a graph
Siam J. on Discrete Math (SIDMA), 26(1), 2012 (399403)

V.E. Levit, E. Mandrescu, On the core of a unicyclic graph
ARS Mathematica Contemporanea, 5, 2012 (321327)

V.E. Levit, E. Mandrescu, Local maximum stable sets greedoids stemming from very wellcovered graphs,
Discrete Applied Mathematics, 160, 2012 (18641871)

E. Mandrescu, Unimodality of some independence polynomials via their palindromicity
Australasian J. of Combinatorics, 53, 2012 (7782)

V.E. Levit, E. Mandrescu, On the independence polynomial of an antiregular graph
Carpathian J. of Mathematics, 28(2), 2012 (279288)

V.E. Levit, E. Mandrescu, When is G2 a KönigEgerváry graph?
Graphs and Combinatorics 2012
[published online: DOI 10.1007/s0037301211965, 8 June 2012]

V.E. Levit, E. Mandrescu
On unicyclic graphs with uniquely restricted maximum matchings
Graphs and Combinatorics 2012
[published online: DOI 10.1007/s0037301212307, 12 October 2012]

V.E. Levit, E. Mandrescu, On the structure of the minimum critical independent set of a graph,
Discrete Mathematics, 313, 2013 (605610)

V.E. Levit, E. Mandrescu, On maximum matchings in KönigEgerváry graphs
Discrete Applied Mathematics, 161, 2013 (16351638)

V.E. Levit, E. Mandrescu, On the intersection of all critical sets of a unicyclic graph
Discrete Applied Mathematics 2013 (in press) ttp://dx.doi.org/10.1016/j.dam.2013.09.006