Igor E. Zverovich

47 papers Journal 46Unranked 1
YearRankTypeTitle / Venue / Authors
2017 J jnl
Graphs with maximal induced matchings of the same size.
Discret. Appl. Math.
Philippe Baptiste, Mikhail Y. Kovalyov, Yury L. Orlovich, Frank Werner, Igor E. Zverovich
2010 J jnl
Friendship Two-Graphs.
Graphs Comb.
Endre Boros, Vladimir Gurvich, Igor E. Zverovich
2009 J jnl
Neighborhood hypergraphs of digraphs and some matrix permutation problems.
Discret. Appl. Math.
Vladimir Gurvich, Igor E. Zverovich
2009 J jnl
On split and almost CIS-graphs.
Australas. J Comb.
Endre Boros, Vladimir Gurvich, Igor E. Zverovich
2008 J jnl
Approximability results for the maximum and minimum maximal induced matching problems.
Discret. Optim.
Yury L. Orlovich, Gerd Finke, Valery S. Gordon, Igor E. Zverovich
2008 J jnl
Neighborhood hypergraphs of bipartite graphs.
J. Graph Theory
Endre Boros, Vladimir Gurvich, Igor E. Zverovich
2007 J jnl
Independent Domination in Triangle Graphs.
Electron. Notes Discret. Math.
Yury L. Orlovich, Igor E. Zverovich
2007 J jnl
The structure of well-covered graphs with no cycles of length 4.
Discret. Math.
Jason I. Brown, Richard J. Nowakowski, Igor E. Zverovich
2006 J jnl
A new kind of graph coloring.
J. Algorithms
Igor E. Zverovich
2006 J jnl
Bipartite bihypergraphs: A survey and new results.
Discret. Math.
Inna Zverovich, Igor E. Zverovich
2006 J jnl
Complexity Of Computing Of The Domination Number In Hereditary Classes Of Graphs.
Ars Comb.
Igor E. Zverovich, Olga I. Zverovich
2006 J jnl
Independent domination in hereditary classes.
Theor. Comput. Sci.
Igor E. Zverovich, Olga I. Zverovich
2006 J jnl
On a perfect problem.
Discuss. Math. Graph Theory
Igor E. Zverovich
2006 J jnl
Polar SAT and related graphs.
J. Discrete Algorithms
Igor E. Zverovich, Olga I. Zverovich
2006 J jnl
Satgraphs and independent domination. Part 1.
Theor. Comput. Sci.
Igor E. Zverovich
2005 J jnl
A finiteness theorem for primal extensions.
Discret. Math.
Igor E. Zverovich
2005 J jnl
Basic perfect graphs and their extensions.
Discret. Math.
Igor E. Zverovich, Vadim E. Zverovich
2005 J jnl
Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes.
Discret. Appl. Math.
Igor E. Zverovich
2005 J jnl
Closure of K
Australas. J Comb.
Igor E. Zverovich, Inessa I. Zverovich
2005 J jnl
Construction of a Maximum Stable Set with $k$-Extensions.
Comb. Probab. Comput.
Peter L. Hammer, Igor E. Zverovich
2005 J jnl
Penta-Extensions of Hereditary Classes of Graphs.
J. Comb. Optim.
Igor E. Zverovich, Inessa I. Zverovich
2005 J jnl
Ratio of generalized stability and domination parameters.
Australas. J Comb.
Igor E. Zverovich, Inessa I. Zverovich
2005 J jnl
The Domination Parameters of Cubic Graphs.
Graphs Comb.
Igor E. Zverovich, Vadim E. Zverovich
2005 J jnl
Unique irredundance, domination and independent domination in graphs.
Discret. Math.
Miranca Fischermann, Lutz Volkmann, Igor E. Zverovich
2004 J jnl
A Characterization of Domination Reducible Graphs.
Graphs Comb.
Igor E. Zverovich
2004 J jnl
A Solution to a Problem of Jacobson, Kézdy and Lehel.
Graphs Comb.
Igor E. Zverovich
2004 J jnl
Dominant-matching graphs.
Discuss. Math. Graph Theory
Igor E. Zverovich, Olga I. Zverovich
2004 J jnl
Forbidden induced subgraph characterization of cograph contractions.
J. Graph Theory
Igor E. Zverovich, Inessa I. Zverovich
2004 J jnl
Stabex method for extension of alpha-polynomial hereditary classes.
Eur. J. Oper. Res.
Igor E. Zverovich
2003 J jnl
Extension of Hereditary Classes with Substitutions.
Discret. Appl. Math.
Igor E. Zverovich
2003 J jnl
Locally Well-Dominated and Locally Independent Well-Dominated Graphs.
Graphs Comb.
Igor E. Zverovich, Vadim E. Zverovich
2003 J jnl
Minimum degree algorithms for stability number.
Discret. Appl. Math.
Igor E. Zverovich
2003 J jnl
Perfect connected-dominant graphs.
Discuss. Math. Graph Theory
Igor E. Zverovich
2003 J jnl
The Domination number of (K
Australas. J Comb.
Igor E. Zverovich
2002 J jnl
Arc Signed Graphs of Oriented Graphs.
Ars Comb.
Igor E. Zverovich
2002 J jnl
Extensions of α-polynomial classes.
Australas. J Comb.
Dieter Rautenbach, Igor E. Zverovich, Inessa I. Zverovich
2002 — conf
The Complexity of Some Problems on Maximal Independent Sets in Graphs.
OR
Igor E. Zverovich, Yury L. Orlovich
2001 J jnl
Locally bounded hereditary subclasses of k-colourable graphs.
Discret. Appl. Math.
Igor E. Zverovich
2000 J jnl
Multi-intersection graphs.
Discret. Math.
Igor E. Zverovich
1999 J jnl
A semi-induced subgraph characterization of upper domination perfect graphs.
J. Graph Theory
Igor E. Zverovich, Vadim E. Zverovich
1999 J jnl
Near-complete multipartite graphs and forbidden induced subgraphs.
Discret. Math.
Igor E. Zverovich
1998 J jnl
Hereditary classes of line graphs.
Ars Comb.
Andrei V. Gagarin, Igor E. Zverovich
1998 J jnl
Proof of a conjecture in domination theory.
Discret. Math.
Igor E. Zverovich
1995 J jnl
An induced subgraph characterization of domination perfect graphs.
J. Graph Theory
Igor E. Zverovich, Vadim E. Zverovich
1994 J jnl
Disproof of a Conjecture in the Domination Theory.
Graphs Comb.
Igor E. Zverovich, Vadim E. Zverovich
1992 J jnl
Contributions to the theory of graphic sequences.
Discret. Math.
Igor E. Zverovich, Vadim E. Zverovich
1991 J jnl
A characterization of domination perfect graphs.
J. Graph Theory
Igor E. Zverovich, Vadim E. Zverovich