Vadim E. Levit

J. Comb. Optim., 2016

Enumeration of balanced finite group valued functions on directed graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2016

Crowns in bipartite graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

On the independence polynomial of the corona of graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Violator spaces and closure operator.

[BibT_eX]

[DOI]

CoRR, 2016

2015

Weighted well-covered claw-free graphs.

[BibT_eX]

[DOI]

Discret. Math., 2015

Well-covered graphs without cycles of lengths 4, 5 and 6.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

2014

On relating edges in graphs without cycles of length 4.

[BibT_eX]

[DOI]

J. Discrete Algorithms, 2014

Groups of balanced labelings on graphs.

[BibT_eX]

[DOI]

Yonah Cherniavsky

Avraham Goldstein

Discret. Math., 2014

Equistable simplicial, very well-covered, and line graphs.

[BibT_eX]

[DOI]

Martin Milanic

Discret. Appl. Math., 2014

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Complexity results on w-well-covered graphs.

[BibT_eX]

[DOI]

CoRR, 2014

Critical Independent Sets of a Graph.

[BibT_eX]

[DOI]

CoRR, 2014

A Set and Collection Lemma.

[BibT_eX]

[DOI]

Electron. J. Comb., 2014

Poly-antimatroid polyhedra.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2014

2013

On Unicyclic Graphs with Uniquely Restricted Maximum Matchings.

[BibT_eX]

[DOI]

Graphs Comb., 2013

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

[BibT_eX]

[DOI]

Graphs Comb., 2013

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

[BibT_eX]

[DOI]

Graphs Comb., 2013

Geometry of poset antimatroids.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

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

[BibT_eX]

[DOI]

Discret. Math., 2013

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Fibonacci Graphs and their Expressions

[BibT_eX]

[DOI]

CoRR, 2013

On the Optimal Representation of Algebraic Expressions of Fibonacci Graphs

[BibT_eX]

[DOI]

CoRR, 2013

On f-Symmetries of the Independence Polynomial

[BibT_eX]

[DOI]

CoRR, 2013

A Solution of Simultaneous Recurrences.

[BibT_eX]

[DOI]

CoRR, 2013

Decomposition Lemmas.

[BibT_eX]

[DOI]

CoRR, 2013

Balanced Abelian group valued functions on directed graphs: Extended abstract.

[BibT_eX]

Yonah Cherniavsky

Avraham Goldstein

Proceedings of the 12th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2013

A One-Vertex Decomposition Algorithm for Generating Algebraic Expressions of Square Rhomboids.

[BibT_eX]

[DOI]

Proceedings of the Frontiers in Algorithmics and Algorithmic Aspects in Information and Management, 2013

2012

Vertices Belonging to All Critical Sets of a Graph.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2012

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

[BibT_eX]

[DOI]

Graphs Comb., 2012

On local maximum stable set greedoids.

[BibT_eX]

[DOI]

Discret. Math., 2012

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

On the core of a unicyclic graph.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2012

On the Recognition of k-Equistable Graphs.

[BibT_eX]

[DOI]

Martin Milanic

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

2011

On Symmetry of Independence Polynomials.

[BibT_eX]

[DOI]

Symmetry, 2011

Mincuts in generalized Fibonacci graphs of degree 3.

[BibT_eX]

[DOI]

J. Comput. Methods Sci. Eng., 2011

Lower Bounds on the Odds Against Tree Spectral Sets.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

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

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2011

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

[BibT_eX]

[DOI]

Discret. Math. Algorithms Appl., 2011

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

[BibT_eX]

[DOI]

Discret. Math., 2011

Foreword.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

Weighted well-covered graphs without C4, C5, C6, C7.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2011

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

[BibT_eX]

[DOI]

CoRR, 2011

An Algorithm Computing the Core of a Konig-Egervary Graph

[BibT_eX]

[DOI]

CoRR, 2011

Critical Sets in Bipartite Graphs

[BibT_eX]

[DOI]

CoRR, 2011

Vertices Belonging to All Critical Independent Sets of a Graph

[BibT_eX]

[DOI]

CoRR, 2011

2010

Duality between quasi-concave functions and monotone linkage functions.

[BibT_eX]

[DOI]

Discret. Math., 2010

Graph operations that are good for greedoids.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

On the independence polynomial of an antiregular graph

[BibT_eX]

[DOI]

CoRR, 2010

When G^2 is a Konig-Egervary graph?

[BibT_eX]

[DOI]

CoRR, 2010

2009

Distributive Lattice Polyhedra.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

Weighted Well-Covered Graphs without Cycles of Length 4, 6 and 7

[BibT_eX]

[DOI]

CoRR, 2009

On Konig-Egervary Square-Stable Graphs.

[BibT_eX]

[DOI]

CoRR, 2009

Greedoids on Vertex Sets of Unicycle Graphs.

[BibT_eX]

[DOI]

CoRR, 2009

The independence polynomial of a graph at -1.

[BibT_eX]

[DOI]

CoRR, 2009

On Related Edges in Well-Covered Graphs without Cycles of Length 4 and 6.

[BibT_eX]

[DOI]

Proceedings of the Graph Theory, 2009

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

[BibT_eX]

[DOI]

Proceedings of the Graph Theory, 2009

A Note on the Recognition of Nested Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Theory, 2009

Recognition of Antimatroidal Point Sets.

[BibT_eX]

[DOI]

Proceedings of the Graph Theory, 2009

2008

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

[BibT_eX]

[DOI]

Discret. Math., 2008

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

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

[BibT_eX]

[DOI]

CoRR, 2008

Geometry of antimatroidal point sets.

[BibT_eX]

[DOI]

CoRR, 2008

The Clique Corona Operation and Greedoids.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization and Applications, 2008

Well-covered Graphs and Greedoids.

[BibT_eX]

[DOI]

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

2007

Matrices and alpha-Stable Bipartite Graphs.

[BibT_eX]

[DOI]

J. Univers. Comput. Sci., 2007

A Geometric Characterization of Poly-antimatroids.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

Representation of poly-antimatroids.

[BibT_eX]

Proceedings of the Sixth Cologne Twente Workshop on Graphs and Combinatorial Optimization, 2007

2006

Nested Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

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

[BibT_eX]

[DOI]

Eur. J. Comb., 2006

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

[BibT_eX]

[DOI]

Discret. Math., 2006

2005

Unicycle graphs and uniquely restricted maximum matchings.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

2003

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

[BibT_eX]

[DOI]

Discret. Math., 2003

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

Correspondence between two Antimatroid Algorithmic Characterizations.

[BibT_eX]

[DOI]

Electron. J. Comb., 2003

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

[BibT_eX]

[DOI]

Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003

On Algebraic Expressions of Series-Parallel and Fibonacci Graphs.

[BibT_eX]

[DOI]

Proceedings of the Discrete Mathematics and Theoretical Computer Science, 2003

2002

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

On the number of vertices belonging to all maximum stable sets of a graph.

[BibT_eX]

[DOI]

Endre Boros

Martin Charles Golumbic

Discret. Appl. Math., 2002

2001

On the structure of ?-stable graphs.

[BibT_eX]

[DOI]

Discret. Math., 2001

Unicycle Bipartite Graphs with Only Uniquely Restricted Maximum Matchings.

[BibT_eX]

[DOI]

Proceedings of the Combinatorics, 2001

1998

On hereditary properties of composition graphs.

[BibT_eX]

[DOI]