סגל

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

E. Olaru, E. Mandrescu, S-strongly perfect Cartesian products of graphs
J. of Graph Theory 16, 1992 (297-305)

V.E. Levit, E. Mandrescu, On -stable graphs
Congressus Numerantium 124, 1997 (33-46)

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

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

V. E. Levit, E. Mandrescu, Well-covered and König-Egervary graphs
Congressus Numerantium 130, 1998 (209-218)

V. E. Levit, E. Mandrescu, Well-covered trees
Congressus Numerantium 139, 1999 (101-112)

V. E. Levit, E. Mandrescu, On ++-stable graphs
Congressus Numerantium 142, 2000 (207-219)

V. E. Levit, E. Mandrescu, On the structure of -stable graphs
Discrete Mathematics 236, 2001 (227-243)

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

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

V.E. Levit, E. Mandrescu, On well-covered trees with unimodal independence
Polynomials, Congressus Numerantium 159, 2002 (193-202)

V. E. Levit, E. Mandrescu, A family of well-covered graphs with unimodal independence polynomials,
Congressus Numerantium 165, 2003 (195-207)

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

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

V. E. Levit, E. Mandrescu, Graph products with log-concave independence polynomials
WSEAS Trans. on Mathematics, 3(3), 2004 (487-493)

V. E. Levit, E. Mandrescu, Very well-covered graphs with log-concave independence
Polynomials, Carpathian J. of Mathematics 20(1), 2004 (73-80)

V. E. Levit, E. Mandrescu, Some operations preserving log-concavity of nonnegative
functions, Mathematical Inequalities and Applications, 9(1) 2006 (63-73)

V. E. Levit, E. Mandrescu, Independence polynomials of well-covered graphs:
Generic counterexamples for the unimodality conjecture,
European J. of Combinatorics, 27, 2006 (931-939)

V. E. Levit, E. Mandrescu, On -critical edges in König-Egerváry graphs
Discrete Mathematics, 306, 2006 (1684-1693)

V.E. Levit, E. Mandrescu, Independence polynomials and the unimodality conjecture for very well-covered, quasi-regularizable, and perfect graphs,
Graph Theory – Trends in Mathematics, 2006 (243-254) Birkhauser Verlag Basel/Switzerland

V. E. Levit, E. Mandrescu, Partial unimodality of the independence polynomial for
König-Egerváry graphs, Congressus Numerantium 179, 2006 (109-119)

V. E. Levit, E. Mandrescu, A family of graphs whose independence polynomials are both palindromic and unimodal,
Carpathian J. of Mathematics, 23(1-2), 2007 (108-116)

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

V. E. Levit, E. Mandrescu, Triangle-free graphs with uniquely restricted maximum
matchings and their corresponding greedoids, Discrete App Math, 155, 2007 (2414-2425)

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

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 well-covered graphs
Congressus Numerantium, 186, 2007 (97-106)

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

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

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

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

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 (1204-1206)

V.E. Levit, E. Mandrescu, Graphs with F-symmetric independence polynomials
Acta Universitatis Apulensis 2011 (185-194)

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

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 (127-138)

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

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

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

V.E. Levit, E. Mandrescu, Critical independent sets and König-Egerváry graphs
Graphs and Combinatorics, 28, 2012 (243-250)

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

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

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

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

V.E. Levit, E. Mandrescu, Local maximum stable sets greedoids stemming from very well-covered graphs,
Discrete Applied Mathematics, 160, 2012 (1864-1871)

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

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

V.E. Levit, E. Mandrescu, When is G2 a König-Egerváry graph?
Graphs and Combinatorics 2012
[published online: DOI 10.1007/s00373-012-1196-5, 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/s00373-012-1230-7, 12 October 2012]

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

V.E. Levit, E. Mandrescu, On maximum matchings in König-Egerváry graphs
Discrete Applied Mathematics, 161, 2013 (1635-1638)

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