default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIgor E. Zverovich
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j48]Philippe Baptiste, Mikhail Y. Kovalyov
, Yury L. Orlovich, Frank Werner, Igor E. Zverovich:
Graphs with maximal induced matchings of the same size. Discret. Appl. Math. 216: 15-28 (2017)- 2010
- [j47]Endre Boros, Vladimir Gurvich, Igor E. Zverovich:
Friendship Two-Graphs. Graphs Comb. 26(5): 617-628 (2010)
2000 – 2009
- 2009
- [j46]Endre Boros, Vladimir Gurvich, Igor E. Zverovich:
On split and almost CIS-graphs. Australas. J Comb. 43: 163-180 (2009) - [j45]Vladimir Gurvich, Igor E. Zverovich:
Neighborhood hypergraphs of digraphs and some matrix permutation problems. Discret. Appl. Math. 157(13): 2836-2845 (2009) - 2008
- [j44]Yury L. Orlovich, Gerd Finke, Valery S. Gordon, Igor E. Zverovich:
Approximability results for the maximum and minimum maximal induced matching problems. Discret. Optim. 5(3): 584-593 (2008) - [j43]Endre Boros, Vladimir Gurvich, Igor E. Zverovich:
Neighborhood hypergraphs of bipartite graphs. J. Graph Theory 58(1): 69-95 (2008) - 2007
- [j42]Jason I. Brown, Richard J. Nowakowski, Igor E. Zverovich:
The structure of well-covered graphs with no cycles of length 4. Discret. Math. 307(17-18): 2235-2245 (2007) - [j41]Yury L. Orlovich, Igor E. Zverovich:
Independent Domination in Triangle Graphs. Electron. Notes Discret. Math. 28: 341-348 (2007) - 2006
- [j40]Igor E. Zverovich, Olga I. Zverovich:
Complexity Of Computing Of The Domination Number In Hereditary Classes Of Graphs. Ars Comb. 78 (2006) - [j39]Inna Zverovich, Igor E. Zverovich:
Bipartite bihypergraphs: A survey and new results. Discret. Math. 306(8-9): 801-811 (2006) - [j38]Igor E. Zverovich:
On a perfect problem. Discuss. Math. Graph Theory 26(2): 273-277 (2006) - [j37]Igor E. Zverovich:
A new kind of graph coloring. J. Algorithms 58(2): 118-133 (2006) - [j36]Igor E. Zverovich, Olga I. Zverovich:
Polar SAT and related graphs. J. Discrete Algorithms 4(1): 155-167 (2006) - [j35]Igor E. Zverovich:
Satgraphs and independent domination. Part 1. Theor. Comput. Sci. 352(1-3): 47-56 (2006) - [j34]Igor E. Zverovich, Olga I. Zverovich:
Independent domination in hereditary classes. Theor. Comput. Sci. 352(1-3): 215-225 (2006) - 2005
- [j33]Igor E. Zverovich, Inessa I. Zverovich:
Closure of K1 + 2K2-free graphs. Australas. J Comb. 31: 3-14 (2005) - [j32]Igor E. Zverovich, Inessa I. Zverovich:
Ratio of generalized stability and domination parameters. Australas. J Comb. 32: 279-284 (2005) - [j31]Peter L. Hammer, Igor E. Zverovich:
Construction of a Maximum Stable Set with $k$-Extensions. Comb. Probab. Comput. 14(3): 311-318 (2005) - [j30]Igor E. Zverovich:
Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes. Discret. Appl. Math. 149(1-3): 200-218 (2005) - [j29]Igor E. Zverovich, Vadim E. Zverovich:
Basic perfect graphs and their extensions. Discret. Math. 293(1-3): 291-311 (2005) - [j28]Igor E. Zverovich:
A finiteness theorem for primal extensions. Discret. Math. 296(1): 103-116 (2005) - [j27]Miranca Fischermann, Lutz Volkmann, Igor E. Zverovich:
Unique irredundance, domination and independent domination in graphs. Discret. Math. 305(1-3): 190-200 (2005) - [j26]Igor E. Zverovich, Vadim E. Zverovich:
The Domination Parameters of Cubic Graphs. Graphs Comb. 21(2): 277-288 (2005) - [j25]Igor E. Zverovich, Inessa I. Zverovich:
Penta-Extensions of Hereditary Classes of Graphs. J. Comb. Optim. 10(2): 169-178 (2005) - 2004
- [j24]Igor E. Zverovich, Olga I. Zverovich:
Dominant-matching graphs. Discuss. Math. Graph Theory 24(3): 485-490 (2004) - [j23]Igor E. Zverovich:
Stabex method for extension of alpha-polynomial hereditary classes. Eur. J. Oper. Res. 155(3): 792-795 (2004) - [j22]Igor E. Zverovich:
A Characterization of Domination Reducible Graphs. Graphs Comb. 20(2): 281-289 (2004) - [j21]Igor E. Zverovich:
A Solution to a Problem of Jacobson, Kézdy and Lehel. Graphs Comb. 20(4): 571-577 (2004) - [j20]Igor E. Zverovich, Inessa I. Zverovich:
Forbidden induced subgraph characterization of cograph contractions. J. Graph Theory 46(3): 217-226 (2004) - 2003
- [j19]Igor E. Zverovich:
The Domination number of (Kp, P5)-free graphs. Australas. J Comb. 27: 95-100 (2003) - [j18]Igor E. Zverovich:
Extension of Hereditary Classes with Substitutions. Discret. Appl. Math. 128(2-3): 487-509 (2003) - [j17]Igor E. Zverovich:
Minimum degree algorithms for stability number. Discret. Appl. Math. 132(1-3): 211-216 (2003) - [j16]Igor E. Zverovich:
Perfect connected-dominant graphs. Discuss. Math. Graph Theory 23(1): 159-162 (2003) - [j15]Igor E. Zverovich, Vadim E. Zverovich:
Locally Well-Dominated and Locally Independent Well-Dominated Graphs. Graphs Comb. 19(2): 279-288 (2003) - 2002
- [j14]Dieter Rautenbach, Igor E. Zverovich, Inessa I. Zverovich:
Extensions of α-polynomial classes. Australas. J Comb. 26: 265-272 (2002) - [j13]Igor E. Zverovich:
Arc Signed Graphs of Oriented Graphs. Ars Comb. 62 (2002) - [j12]Igor E. Zverovich:
r-Bounded k-complete bipartite bihypergraphs and generalized split graphs. Discret. Math. 247(1-3): 261-270 (2002) - [c1]Igor E. Zverovich, Yury L. Orlovich:
The Complexity of Some Problems on Maximal Independent Sets in Graphs. OR 2002: 389-394 - 2001
- [j11]Igor E. Zverovich:
Locally bounded hereditary subclasses of k-colourable graphs. Discret. Appl. Math. 114(1-3): 301-311 (2001) - 2000
- [j10]Igor E. Zverovich:
Multi-intersection graphs. Discret. Math. 218(1-3): 245-251 (2000)
1990 – 1999
- 1999
- [j9]Igor E. Zverovich:
Near-complete multipartite graphs and forbidden induced subgraphs. Discret. Math. 207(1-3): 257-262 (1999) - [j8]Igor E. Zverovich, Vadim E. Zverovich:
A semi-induced subgraph characterization of upper domination perfect graphs. J. Graph Theory 31(1): 29-49 (1999) - [j7]Igor E. Zverovich:
k-Bounded classes of dominant-independent perfect graphs. J. Graph Theory 32(3): 303-310 (1999) - 1998
- [j6]Andrei V. Gagarin, Igor E. Zverovich:
Hereditary classes of line graphs. Ars Comb. 48 (1998) - [j5]Igor E. Zverovich:
Proof of a conjecture in domination theory. Discret. Math. 184(1-3): 297-298 (1998) - 1995
- [j4]Igor E. Zverovich, Vadim E. Zverovich:
An induced subgraph characterization of domination perfect graphs. J. Graph Theory 20(3): 375-395 (1995) - 1994
- [j3]Igor E. Zverovich, Vadim E. Zverovich:
Disproof of a Conjecture in the Domination Theory. Graphs Comb. 10(2-4): 389-396 (1994) - 1992
- [j2]Igor E. Zverovich, Vadim E. Zverovich:
Contributions to the theory of graphic sequences. Discret. Math. 105(1-3): 293-303 (1992) - 1991
- [j1]Igor E. Zverovich, Vadim E. Zverovich:
A characterization of domination perfect graphs. J. Graph Theory 15(2): 109-114 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:03 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
