Eugen Mandrescu

According to our database, Eugen Mandrescu authored at least 71 papers between 1992 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

Log-concavity of the independence polynomials of W_p graphs.

Dô Trong Hoang, Vadim E. Levit, Eugen Mandrescu, My Hanh Pham

CoRR, 2024

Almost Bipartite non-König-Egerváry Graphs Revisited.

Vadim E. Levit, Eugen Mandrescu

CoRR, 2024

On the Number of Vertices/Edges whose Deletion Preserves the Konig-Egervary Property.

Vadim E. Levit, Eugen Mandrescu

CoRR, 2024

2022

On graphs admitting two disjoint maximum independent sets.

Zakir Deniz, Vadim E. Levit, Eugen Mandrescu

Art Discret. Appl. Math., September, 2022

Critical sets, crowns and local maximum independent sets.

Vadim E. Levit, Eugen Mandrescu

J. Glob. Optim., 2022

Some More Updates on an Annihilation Number Conjecture: Pros and Cons.

Vadim E. Levit, Eugen Mandrescu

Graphs Comb., 2022

On Minimal Critical Independent Sets of Almost Bipartite non-Konig-Egervary Graphs.

Vadim E. Levit, Eugen Mandrescu

CoRR, 2022

2020

On an annihilation number conjecture.

Vadim E. Levit, Eugen Mandrescu

Ars Math. Contemp., 2020

2019

Monotonic Properties of Collections of Maximum Independent Sets of a Graph.

Adi Jarden, Vadim E. Levit, Eugen Mandrescu

Order, 2019

1-well-covered graphs revisited.

Vadim E. Levit, Eugen Mandrescu

Eur. J. Comb., 2019

On the Critical Difference of Almost Bipartite Graphs.

Vadim E. Levit, Eugen Mandrescu

CoRR, 2019

On König-Egerváry collections of maximum critical independent sets.

Vadim E. Levit, Eugen Mandrescu

Art Discret. Appl. Math., 2019

Critical and Maximum Independent Sets Revisited.

Vadim E. Levit, Eugen Mandrescu

Proceedings of the Mathematical Optimization Theory and Operations Research, 2019

2018

Graph Operations Preserving <i>W</i>₂-Property.

Vadim E. Levit, Eugen Mandrescu

Electron. Notes Discret. Math., 2018

Critical and maximum independent sets of a graph.

Adi Jarden, Vadim E. Levit, Eugen Mandrescu

Discret. Appl. Math., 2018

2017

The Roller-Coaster Conjecture Revisited.

Vadim E. Levit, Eugen Mandrescu

Graphs Comb., 2017

W₂-graphs and shedding vertices.

Vadim E. Levit, Eugen Mandrescu

Electron. Notes Discret. Math., 2017

Two more characterizations of König-Egerváry graphs.

Adi Jarden, Vadim E. Levit, Eugen Mandrescu

Discret. Appl. Math., 2017

2016

Computing unique maximum matchings in O(m) time for König-Egerváry graphs and unicyclic graphs.

Vadim E. Levit, Eugen Mandrescu

J. Comb. Optim., 2016

Crowns in bipartite graphs.

Vadim E. Levit, Eugen Mandrescu

Electron. Notes Discret. Math., 2016

On the independence polynomial of the corona of graphs.

Vadim E. Levit, Eugen Mandrescu

Discret. Appl. Math., 2016

2014

On the intersection of all critical sets of a unicyclic graph.

Vadim E. Levit, Eugen Mandrescu

Discret. Appl. Math., 2014

Critical Independent Sets of a Graph.

Vadim E. Levit, Eugen Mandrescu

CoRR, 2014

A Set and Collection Lemma.

Vadim E. Levit, Eugen Mandrescu

Electron. J. Comb., 2014

2013

On Unicyclic Graphs with Uniquely Restricted Maximum Matchings.

Vadim E. Levit, Eugen Mandrescu

Graphs Comb., 2013

When is G 2 a König-Egerváry Graph?

Vadim E. Levit, Eugen Mandrescu

Graphs Comb., 2013

The Cyclomatic Number of a Graph and its Independence Polynomial at -1.

Vadim E. Levit, Eugen Mandrescu

Graphs Comb., 2013

On the structure of the minimum critical independent set of a graph.

Vadim E. Levit, Eugen Mandrescu

Discret. Math., 2013

On maximum matchings in König-Egerváry graphs.

Vadim E. Levit, Eugen Mandrescu

Discret. Appl. Math., 2013

On f-Symmetries of the Independence Polynomial

Vadim E. Levit, Eugen Mandrescu

CoRR, 2013

2012

Vertices Belonging to All Critical Sets of a Graph.

Vadim E. Levit, Eugen Mandrescu

SIAM J. Discret. Math., 2012

Critical Independent Sets and König-Egerváry Graphs.

Vadim E. Levit, Eugen Mandrescu

Graphs Comb., 2012

On local maximum stable set greedoids.

Vadim E. Levit, Eugen Mandrescu

Discret. Math., 2012

Local maximum stable set greedoids stemming from very well-covered graphs.

Vadim E. Levit, Eugen Mandrescu

Discret. Appl. Math., 2012

On the core of a unicyclic graph.

Vadim E. Levit, Eugen Mandrescu

Ars Math. Contemp., 2012

Unimodality of some independence polynomials via their palindromicity.

Eugen Mandrescu

Australas. J Comb., 2012

2011

On Symmetry of Independence Polynomials.

Vadim E. Levit, Eugen Mandrescu

Symmetry, 2011

A Characterization of König-Egerváry Graphs Using a Common Property of All Maximum Matchings.

Vadim E. Levit, Eugen Mandrescu

Electron. Notes Discret. Math., 2011

Very Well-Covered Graphs of girth at Least Four and Local Maximum Stable Set Greedoids.

Vadim E. Levit, Eugen Mandrescu

Discret. Math. Algorithms Appl., 2011

A simple proof of an inequality connecting the alternating number of independent sets and the decycling number.

Vadim E. Levit, Eugen Mandrescu

Discret. Math., 2011

Local Maximum Stable Sets Greedoids Stemmed from Very Well-Covered Graphs

Vadim E. Levit, Eugen Mandrescu

CoRR, 2011

An Algorithm Computing the Core of a Konig-Egervary Graph

Vadim E. Levit, Eugen Mandrescu

CoRR, 2011

Critical Sets in Bipartite Graphs

Vadim E. Levit, Eugen Mandrescu

CoRR, 2011

Vertices Belonging to All Critical Independent Sets of a Graph

Vadim E. Levit, Eugen Mandrescu

CoRR, 2011

2010

Graph operations that are good for greedoids.

Vadim E. Levit, Eugen Mandrescu

Discret. Appl. Math., 2010

On the independence polynomial of an antiregular graph

Vadim E. Levit, Eugen Mandrescu

CoRR, 2010

When G^2 is a Konig-Egervary graph?

Vadim E. Levit, Eugen Mandrescu

CoRR, 2010

2009

Building Graphs Whose Independence Polynomials Have Only Real Roots.

Eugen Mandrescu

Graphs Comb., 2009

On Konig-Egervary Square-Stable Graphs.

Vadim E. Levit, Eugen Mandrescu

CoRR, 2009

Greedoids on Vertex Sets of Unicycle Graphs.

Vadim E. Levit, Eugen Mandrescu

CoRR, 2009

The independence polynomial of a graph at -1.

Vadim E. Levit, Eugen Mandrescu

CoRR, 2009

On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph.

Vadim E. Levit, Eugen Mandrescu

Proceedings of the Graph Theory, 2009

2008

The intersection of all maximum stable sets of a tree and its pendant vertices.

Vadim E. Levit, Eugen Mandrescu

Discret. Math., 2008

On the roots of independence polynomials of almost all very well-covered graphs.

Vadim E. Levit, Eugen Mandrescu

Discret. Appl. Math., 2008

Interval greedoids and families of local maximum stable sets of graphs.

Vadim E. Levit, Eugen Mandrescu

CoRR, 2008

The Clique Corona Operation and Greedoids.

Vadim E. Levit, Eugen Mandrescu

Proceedings of the Combinatorial Optimization and Applications, 2008

Well-covered Graphs and Greedoids.

Vadim E. Levit, Eugen Mandrescu

Proceedings of the Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), 2008

2007

Matrices and alpha-Stable Bipartite Graphs.

Vadim E. Levit, Eugen Mandrescu

J. Univers. Comput. Sci., 2007

Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids.

Vadim E. Levit, Eugen Mandrescu

Discret. Appl. Math., 2007

2006

Independence polynomials of well-covered graphs: Generic counterexamples for the unimodality conjecture.

Vadim E. Levit, Eugen Mandrescu

Eur. J. Comb., 2006

On alpha-critical edges in König-Egerváry graphs.

Vadim E. Levit, Eugen Mandrescu

Discret. Math., 2006

2005

Unicycle graphs and uniquely restricted maximum matchings.

Vadim E. Levit, Eugen Mandrescu

Electron. Notes Discret. Math., 2005

2003

On alpha⁺-stable Ko"nig-Egerváry graphs.

Vadim E. Levit, Eugen Mandrescu

Discret. Math., 2003

Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings.

Vadim E. Levit, Eugen Mandrescu

Discret. Appl. Math., 2003

On Unimodality of Independence Polynomials of Some Well-Covered Trees.

Vadim E. Levit, Eugen Mandrescu

Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003

2002

Combinatorial properties of the family of maximum stable sets of a graph.

Vadim E. Levit, Eugen Mandrescu

Discret. Appl. Math., 2002

A new Greedoid: the family of local maximum stable sets of a forest.

Vadim E. Levit, Eugen Mandrescu

Discret. Appl. Math., 2002

2001

On the structure of ?-stable graphs.

Vadim E. Levit, Eugen Mandrescu

Discret. Math., 2001

Unicycle Bipartite Graphs with Only Uniquely Restricted Maximum Matchings.

Vadim E. Levit, Eugen Mandrescu

Proceedings of the Combinatorics, 2001

1998

On hereditary properties of composition graphs.

Vadim E. Levit, Eugen Mandrescu

Discuss. Math. Graph Theory, 1998

1992

<i>s</i>-strongly perfect cartesian product of graphs.

Elefterie Olaru, Eugen Mandrescu

J. Graph Theory, 1992