According to our database
1,
Eugen Mandrescu
authored at least 73 papers
between 1992 and 2025.
Collaborative distances:
2025
On almost bipartite non-König-Egerváry graphs.
Discret. Appl. Math., 2025
2024
On corona of Konig-Egervary graphs.
CoRR, 2024
Log-concavity of the independence polynomials of W<sub>p</sub> graphs.
CoRR, 2024
Almost Bipartite non-König-Egerváry Graphs Revisited.
CoRR, 2024
On the Number of Vertices/Edges whose Deletion Preserves the Konig-Egervary Property.
CoRR, 2024
2022
On graphs admitting two disjoint maximum independent sets.
Art Discret. Appl. Math., September, 2022
Critical sets, crowns and local maximum independent sets.
J. Glob. Optim., 2022
Some More Updates on an Annihilation Number Conjecture: Pros and Cons.
Graphs Comb., 2022
On Minimal Critical Independent Sets of Almost Bipartite non-Konig-Egervary Graphs.
CoRR, 2022
2020
On an annihilation number conjecture.
Ars Math. Contemp., 2020
2019
Monotonic Properties of Collections of Maximum Independent Sets of a Graph.
Order, 2019
1-well-covered graphs revisited.
Eur. J. Comb., 2019
On the Critical Difference of Almost Bipartite Graphs.
CoRR, 2019
On König-Egerváry collections of maximum critical independent sets.
Art Discret. Appl. Math., 2019
Critical and Maximum Independent Sets Revisited.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2019
2018
Graph Operations Preserving <i>W</i><sub>2</sub>-Property.
Electron. Notes Discret. Math., 2018
Critical and maximum independent sets of a graph.
Discret. Appl. Math., 2018
2017
The Roller-Coaster Conjecture Revisited.
Graphs Comb., 2017
W<sub>2</sub>-graphs and shedding vertices.
Electron. Notes Discret. Math., 2017
Two more characterizations of König-Egerváry graphs.
Discret. Appl. Math., 2017
2016
Computing unique maximum matchings in O(m) time for König-Egerváry graphs and unicyclic graphs.
J. Comb. Optim., 2016
Crowns in bipartite graphs.
Electron. Notes Discret. Math., 2016
On the independence polynomial of the corona of graphs.
Discret. Appl. Math., 2016
2014
On the intersection of all critical sets of a unicyclic graph.
Discret. Appl. Math., 2014
Critical Independent Sets of a Graph.
CoRR, 2014
A Set and Collection Lemma.
Electron. J. Comb., 2014
2013
On Unicyclic Graphs with Uniquely Restricted Maximum Matchings.
Graphs Comb., 2013
When is G 2 a König-Egerváry Graph?
Graphs Comb., 2013
The Cyclomatic Number of a Graph and its Independence Polynomial at -1.
Graphs Comb., 2013
On the structure of the minimum critical independent set of a graph.
Discret. Math., 2013
On maximum matchings in König-Egerváry graphs.
Discret. Appl. Math., 2013
On f-Symmetries of the Independence Polynomial
CoRR, 2013
2012
Vertices Belonging to All Critical Sets of a Graph.
SIAM J. Discret. Math., 2012
Critical Independent Sets and König-Egerváry Graphs.
Graphs Comb., 2012
On local maximum stable set greedoids.
Discret. Math., 2012
Local maximum stable set greedoids stemming from very well-covered graphs.
Discret. Appl. Math., 2012
On the core of a unicyclic graph.
Ars Math. Contemp., 2012
Unimodality of some independence polynomials via their palindromicity.
Australas. J Comb., 2012
2011
On Symmetry of Independence Polynomials.
Symmetry, 2011
A Characterization of König-Egerváry Graphs Using a Common Property of All Maximum Matchings.
Electron. Notes Discret. Math., 2011
Very Well-Covered Graphs of girth at Least Four and Local Maximum Stable Set Greedoids.
Discret. Math. Algorithms Appl., 2011
A simple proof of an inequality connecting the alternating number of independent sets and the decycling number.
Discret. Math., 2011
Local Maximum Stable Sets Greedoids Stemmed from Very Well-Covered Graphs
CoRR, 2011
An Algorithm Computing the Core of a Konig-Egervary Graph
CoRR, 2011
Critical Sets in Bipartite Graphs
CoRR, 2011
Vertices Belonging to All Critical Independent Sets of a Graph
CoRR, 2011
2010
Graph operations that are good for greedoids.
Discret. Appl. Math., 2010
On the independence polynomial of an antiregular graph
CoRR, 2010
When G^2 is a Konig-Egervary graph?
CoRR, 2010
2009
Building Graphs Whose Independence Polynomials Have Only Real Roots.
Graphs Comb., 2009
On Konig-Egervary Square-Stable Graphs.
CoRR, 2009
Greedoids on Vertex Sets of Unicycle Graphs.
CoRR, 2009
The independence polynomial of a graph at -1.
CoRR, 2009
On Duality between Local Maximum Stable Sets of a Graph and Its Line-Graph.
Proceedings of the Graph Theory, 2009
2008
The intersection of all maximum stable sets of a tree and its pendant vertices.
Discret. Math., 2008
On the roots of independence polynomials of almost all very well-covered graphs.
Discret. Appl. Math., 2008
Interval greedoids and families of local maximum stable sets of graphs.
CoRR, 2008
The Clique Corona Operation and Greedoids.
Proceedings of the Combinatorial Optimization and Applications, 2008
Well-covered Graphs and Greedoids.
Proceedings of the Theory of Computing 2008. Proc. Fourteenth Computing: The Australasian Theory Symposium (CATS 2008), 2008
2007
Matrices and alpha-Stable Bipartite Graphs.
J. Univers. Comput. Sci., 2007
Triangle-free graphs with uniquely restricted maximum matchings and their corresponding greedoids.
Discret. Appl. Math., 2007
2006
Independence polynomials of well-covered graphs: Generic counterexamples for the unimodality conjecture.
Eur. J. Comb., 2006
On alpha-critical edges in König-Egerváry graphs.
Discret. Math., 2006
2005
Unicycle graphs and uniquely restricted maximum matchings.
Electron. Notes Discret. Math., 2005
2003
On alpha<sup>+</sup>-stable Ko"nig-Egerváry graphs.
Discret. Math., 2003
Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings.
Discret. Appl. Math., 2003
On Unimodality of Independence Polynomials of Some Well-Covered Trees.
Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003
2002
Combinatorial properties of the family of maximum stable sets of a graph.
Discret. Appl. Math., 2002
A new Greedoid: the family of local maximum stable sets of a forest.
Discret. Appl. Math., 2002
2001
On the structure of ?-stable graphs.
Discret. Math., 2001
Unicycle Bipartite Graphs with Only Uniquely Restricted Maximum Matchings.
Proceedings of the Combinatorics, 2001
1998
On hereditary properties of composition graphs.
Discuss. Math. Graph Theory, 1998
1992
<i>s</i>-strongly perfect cartesian product of graphs.
J. Graph Theory, 1992
