default search action
Magdalena Lemanska
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
- [j29]Magdalena Lemanska
, Mercè Mora
Graphs with isolation number equal to one third of the order. Discret. Math. 347(5): 113903 (2024) - 2021
- [j28]Sergio Bermudo
Some variants of perfect graphs related to the matching number, the vertex cover and the weakly connected domination number. Discret. Appl. Math. 304: 153-163 (2021) - [j27]Ammar Babikir
Independent Domination Subdivision in Graphs. Graphs Comb. 37(3): 691-709 (2021) - [j26]Magda Dettlaff
Secure Italian domination in graphs. J. Comb. Optim. 41(1): 56-72 (2021) - [j25]Magda Dettlaff
Common Independence in Graphs. Symmetry 13(8): 1411 (2021) - 2020
- [j24]Magda Dettlaff, Magdalena Lemanska, Jerzy Topp
Certified domination. AKCE Int. J. Graphs Comb. 17(1): 86-97 (2020) - 2019
- [j23]César Hernández-Cruz, Magdalena Lemanska, Rita Zuazua:
A characterization of trees having a minimum vertex cover which is also a minimum total dominating set. Australas. J Comb. 73: 334-345 (2019) - [j22]Magda Dettlaff
On the super domination number of lexicographic product graphs. Discret. Appl. Math. 263: 118-129 (2019) - [j21]Magdalena Lemanska, Joaquín Tey, Rita Zuazua:
Relations between edge removing and edge subdivision concerning domination number of a graph. Discret. Appl. Math. 263: 212-219 (2019) - [j20]Magdalena Lemanska, Eduardo Rivera-Campo, Radoslaw Ziemann, Rita Zuazua, Pawel Zylinski
Convex dominating sets in maximal outerplanar graphs. Discret. Appl. Math. 265: 142-157 (2019) - 2018
- [j19]Joanna Cyman
Total domination in versus paired-domination in regular graphs. Discuss. Math. Graph Theory 38(2): 573-586 (2018) - [j18]Joanna Cyman
Total Domination Versus Domination in Cubic Graphs. Graphs Comb. 34(1): 261-276 (2018) - 2017
- [j17]Magdalena Lemanska, Juan Alberto Rodríguez-Velázquez
Similarities and Differences Between the Vertex Cover Number and the Weakly Connected Domination Number of a Graph. Fundam. Informaticae 152(3): 273-287 (2017) - [j16]Magdalena Lemanska
Total Dominating Sets in Maximal Outerplanar Graphs. Graphs Comb. 33(4): 991-998 (2017) - 2016
- [j15]Agata Kucienska, Magdalena Lemanska, Joanna Raczek:
Weakly convex and convex domination numbers of some products of graphs. Ars Comb. 124: 409-420 (2016) - [j14]Magda Dettlaff
Some variations of perfect graphs. Discuss. Math. Graph Theory 36(3): 661-668 (2016) - 2015
- [j13]Diana Avella-Alaminos, Magda Dettlaff
Total domination multisubdivision number of a graph. Discuss. Math. Graph Theory 35(2): 315-327 (2015) - 2014
- [j12]Juan Alberto Rodríguez-Velázquez
On the partition dimension of trees. Discret. Appl. Math. 166: 204-209 (2014) - [j11]Magda Dettlaff
Bondage number of grid graphs. Discret. Appl. Math. 167: 94-99 (2014) - 2012
- [j10]Magda Dettlaff, Magdalena Lemanska:
Influence of edge subdivision on the convex domination number. Australas. J Comb. 53: 19-30 (2012) - [j9]Magdalena Lemanska
Convex universal fixers. Discuss. Math. Graph Theory 32(4): 807-812 (2012) - [j8]Magdalena Lemanska
Nordhaus-Gaddum results for the convex domination number of a graph. Period. Math. Hung. 65(1): 125-134 (2012) - 2010
- [j7]Magda Dettlaff, Magdalena Lemanska:
Strong weakly connected domination subdivisible graphs. Australas. J Comb. 47: 269-278 (2010) - [j6]Joanna Raczek
A note on the weakly convex and convex domination numbers of a torus. Discret. Appl. Math. 158(15): 1708-1713 (2010) - [j5]Magdalena Lemanska:
Nordhaus-Gaddum results for weakly convex domination number of a graph. Discuss. Math. Graph Theory 30(2): 257-263 (2010) - 2007
- [j4]Magdalena Lemanska:
Lower bound on the weakly connected domination number of a tree. Australas. J Comb. 37: 67-72 (2007) - 2006
- [j3]Joanna Cyman, Magdalena Lemanska, Joanna Raczek
Graphs with convex domination number close to their order. Discuss. Math. Graph Theory 26(2): 307-316 (2006) - 2005
- [j2]Magdalena Lemanska:
Domination Numbers in Graphs with Removed Edge or Set of Edges. Discuss. Math. Graph Theory 25(1-2): 51-56 (2005) - 2004
- [j1]Magdalena Lemanska:
Lower bound on the domination number of a tree. Discuss. Math. Graph Theory 24(2): 165-169 (2004)
Conference and Workshop Papers
- 2023
- [c2]Magda Dettlaff, Magdalena Lemanska, Jerzy Topp:
Common edge independence number of a tree (Brief Announcement). LAGOS 2023: 385-387 - 2010
- [c1]Ismael González Yero, Juan Alberto Rodríguez-Velázquez, Magdalena Lemanska:
On the Partition Dimension of Cartesian Product Graphs. CTW 2010: 61-64
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 20:24 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: