default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJerzy Topp
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j26]Magda Dettlaff
, Michael A. Henning, Jerzy Topp:
Common domination perfect graphs. Discret. Appl. Math. 342: 253-259 (2024)- [j25]Michael A. Henning, Jerzy Topp:
Minimal graphs with disjoint dominating and total dominating sets. Discuss. Math. Graph Theory 44(1): 47 (2024) - 2023
- [c1]Magda Dettlaff, Magdalena Lemanska, Jerzy Topp:
Common edge independence number of a tree (Brief Announcement). LAGOS 2023: 385-387 - 2022
- [j24]Michael A. Henning, Jerzy Topp:
Graphs with disjoint $2$-dominating sets. Australas. J Comb. 83: 163-172 (2022) - 2021
- [j23]Michael A. Henning, Jerzy Topp:
Minimal graphs with disjoint dominating and paired-dominating sets. Discuss. Math. Graph Theory 41(3): 827-847 (2021) - [j22]Magda Dettlaff, Magdalena Lemanska, Jerzy Topp:
Common Independence in Graphs. Symmetry 13(8): 1411 (2021) - 2020
- [j21]Magda Dettlaff, Magdalena Lemanska, Jerzy Topp, Radoslaw Ziemann, Pawel Zylinski:
Certified domination. AKCE Int. J. Graphs Comb. 17(1): 86-97 (2020) - [j20]Mateusz Miotk, Jerzy Topp, Pawel Zylinski:
Disjoint dominating and 2-dominating sets in graphs. Discret. Optim. 35: 100553 (2020) - [j19]Andrzej Lingas, Mateusz Miotk, Jerzy Topp, Pawel Zylinski:
Graphs with equal domination and covering numbers. J. Comb. Optim. 39(1): 55-71 (2020)
2010 – 2019
- 2019
- [j18]Joanna Cyman, Michael A. Henning, Jerzy Topp:
On accurate domination in graphs. Discuss. Math. Graph Theory 39(3): 615-627 (2019) - [j17]Magda Dettlaff, Joanna Raczek, Jerzy Topp:
Domination subdivision and domination multisubdivision numbers of graph. Discuss. Math. Graph Theory 39(4): 829-839 (2019) - [j16]Mateusz Miotk, Jerzy Topp, Pawel Zylinski:
Bipartization of Graphs. Graphs Comb. 35(5): 1169-1177 (2019) - 2015
- [i1]Mateusz Miotk, Jerzy Topp:
Hangable Graph. CoRR abs/1512.07767 (2015)
2000 – 2009
- 2000
- [j15]Jerzy Topp, Preben D. Vestergaard:
alphak- and gammak-stable graphs. Discret. Math. 212(1-2): 149-160 (2000)
1990 – 1999
- 1998
- [j14]Jerzy Topp, Preben D. Vestergaard:
Interpolation theorems for the (r, s)-domination number of spanning trees. Australas. J Comb. 17: 99-108 (1998) - [j13]Jerzy Topp, Preben D. Vestergaard:
Interpolation theorems for domination numbers of a graph. Discret. Math. 191(1-3): 207-221 (1998) - 1997
- [j12]Jerzy Topp, Preben D. Vestergaard:
Totally equimatchable graphs. Discret. Math. 164(1-3): 285-290 (1997) - 1996
- [j11]Jerzy Topp, Preben D. Vestergaard:
On numbers of vertices of maximum degree in the spanning trees of a graph. Discret. Math. 155(1-3): 247-258 (1996) - [j10]Erich Prisner, Jerzy Topp, Preben D. Vestergaard:
Well covered simplicial, chordal, and circular arc graphs. J. Graph Theory 21(2): 113-119 (1996) - 1995
- [j9]Jerzy Topp, Preben D. Vestergaard:
Well Irredundant Graphs. Discret. Appl. Math. 63(3): 267-276 (1995) - [j8]Jerzy Topp:
Sequences of graphical invariants. Networks 25(1): 1-5 (1995) - 1994
- [j7]Werner Siemes, Jerzy Topp, Lutz Volkmann:
On unique independent sets in graphs. Discret. Math. 131(1-3): 279-285 (1994) - 1993
- [j6]Jerzy Topp, Lutz Volkmann:
Some upper bounds for the product of the domination number and the chromatic number of a graph. Discret. Math. 118(1-3): 289-292 (1993) - [j5]Jerzy Topp:
Graphs with unique minimum edge dominating sets and graphs with unique maximum independent sets of vertices. Discret. Math. 121(1-3): 199-210 (1993) - [j4]Jerzy Topp, Preben D. Vestergaard:
Odd factors of a graph. Graphs Comb. 9(2-4): 371-381 (1993) - [j3]Jerzy Topp, Lutz Volkmann:
Sufficient conditions for equality of connectivity and minimum degree of a graph. J. Graph Theory 17(6): 695-700 (1993) - 1991
- [j2]Jerzy Topp, Lutz Volkmann:
On graphs with equal domination and independent domination numbers. Discret. Math. 96(1): 75-80 (1991) - [j1]Jerzy Topp, Lutz Volkmann:
On packing and covering numbers of graphs. Discret. Math. 96(3): 229-238 (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 2024-08-05 21:13 CEST 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:
