default search action
Monika Pilsniak
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j54]Igor Grzelec
, Monika Pilsniak
A note on uniquely embeddable 2-factors. Appl. Math. Comput. 468: 128505 (2024) - 2023
- [j53]Felix Bock, Rafal Kalinowski
Majority Edge-Colorings of Graphs. Electron. J. Comb. 30(1) (2023) - [j52]Aleksandra Gorzkowska
Total and paired domination stability in prisms. Discuss. Math. Graph Theory 43(4): 1147-1169 (2023) - 2022
- [j51]Rafal Kalinowski
Distinguishing arc-colourings of symmetric digraphs. Art Discret. Appl. Math. 6(2): 2 (2022) - [j50]Michael A. Henning, Monika Pilsniak
Bounds on the paired domination number of graphs with minimum degree at least three. Appl. Math. Comput. 417: 126782 (2022) - [j49]Rafal Kalinowski
Proper distinguishing arc-colourings of symmetric digraphs. Appl. Math. Comput. 421: 126939 (2022) - [j48]Aleksandra Gorzkowska
Paired domination stability in graphs. Ars Math. Contemp. 22(2): 2 (2022) - [j47]Rafal Kalinowski
Extremal graphs for the distinguishing index. Discret. Math. 345(8): 112905 (2022) - [j46]Florian Lehner
Corrigendum to "A bound for the distinguishing index of regular graphs" [European J. Combin. 89 (2020) 103145]. Eur. J. Comb. 101: 103489 (2022) - [j45]Aleksandra Gorzkowska
Paired Domination in Trees. Graphs Comb. 38(4): 129 (2022) - [j44]Florian Lehner
Distinguishing infinite graphs with bounded degrees. J. Graph Theory 101(1): 52-65 (2022) - 2021
- [j43]Monika Pilsniak
Nordhaus-Gaddum type inequalities for the distinguishing index. Ars Math. Contemp. 20(2): 223-231 (2021) - [j42]Wilfried Imrich
On Asymmetric Colourings of Claw-Free Graphs. Electron. J. Comb. 28(3): 3 (2021) - 2020
- [j41]Wilfried Imrich
The distinguishing index of connected graphs without pendant edges. Ars Math. Contemp. 18(1): 117-126 (2020) - [j40]Olivier Baudon, Hervé Hocquard, Antoni Marczyk, Monika Pilsniak
On a total version of 1-2-3 Conjecture. Discuss. Math. Graph Theory 40(4): 1175-1186 (2020) - [j39]Monika Pilsniak
Distinguishing index of maps. Eur. J. Comb. 84 (2020) - [j38]Florian Lehner, Monika Pilsniak
A bound for the distinguishing index of regular graphs. Eur. J. Comb. 89: 103145 (2020) - [j37]Monika Pilsniak
The optimal general upper bound for the distinguishing index of infinite graphs. J. Graph Theory 93(4): 463-469 (2020)
2010 – 2019
- 2019
- [j36]Izak Broere, Wilfried Imrich
Asymmetric colorings of products of graphs and digraphs. Discret. Appl. Math. 266: 56-64 (2019) - 2017
- [j35]Aleksandra Gorzkowska
The distinguishing index of the Cartesian product of finite graphs. Ars Math. Contemp. 12(1): 77-87 (2017) - [j34]Izak Broere, Monika Pilsniak
The distinguishing index of the Cartesian product of countable graphs. Ars Math. Contemp. 13(1): 15-21 (2017) - [j33]Monika Pilsniak
Improving upper bounds for the distinguishing index. Ars Math. Contemp. 13(2): 259-274 (2017) - [j32]Wilfried Imrich
Bounds for Distinguishing Invariants of Infinite Graphs. Electron. J. Comb. 24(3): 3 (2017) - [j31]Olivier Baudon, Monika Pilsniak
Equitable neighbour-sum-distinguishing edge and total colourings. Discret. Appl. Math. 222: 40-53 (2017) - [j30]Rafal Kalinowski
A note on breaking small automorphisms in graphs. Discret. Appl. Math. 232: 221-225 (2017) - [j29]Olivier Baudon, Julien Bensmail, Florent Foucaud, Monika Pilsniak
Structural properties of recursively partitionable graphs with connectivity 2. Discuss. Math. Graph Theory 37(1): 89-115 (2017) - [j28]Ehsan Estaji, Wilfried Imrich
Distinguishing Cartesian products of countable graphs. Discuss. Math. Graph Theory 37(1): 155-164 (2017) - [j27]Monika Pilsniak
Edge motion and the distinguishing index. Theor. Comput. Sci. 678: 56-62 (2017) - [j26]Aleksandra Gorzkowska
Precise bounds for the distinguishing index of the Cartesian product. Theor. Comput. Sci. 687: 62-69 (2017) - [i1]Olivier Baudon, Monika Pilsniak, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak:
Equitable neighbour-sum-distinguishing edge and total colourings. CoRR abs/1701.04648 (2017) - 2016
- [j25]Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak:
Distinguishing graphs by total colourings. Ars Math. Contemp. 11(1): 79-89 (2016) - [j24]Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak:
Preface. Discret. Math. 339(7): 1827 (2016) - [j23]Rafal Kalinowski, Monika Pilsniak, Ingo Schiermeyer, Mariusz Wozniak:
Dense arbitrarily partitionable graphs. Discuss. Math. Graph Theory 36(1): 5-22 (2016) - 2015
- [j22]Izak Broere, Monika Pilsniak:
The Distinguishing Index of Infinite Graphs. Electron. J. Comb. 22(1): 1 (2015) - [j21]Rafal Kalinowski, Monika Pilsniak:
Distinguishing graphs by edge-colourings. Eur. J. Comb. 45: 124-131 (2015) - [j20]Monika Pilsniak, Mariusz Wozniak:
On the Total-Neighbor-Distinguishing Index by Sums. Graphs Comb. 31(3): 771-782 (2015) - 2014
- [j19]Wilfried Imrich, Rafal Kalinowski, Florian Lehner
Endomorphism Breaking in Graphs. Electron. J. Comb. 21(1): 1 (2014) - [j18]Rafal Kalinowski, Monika Pilsniak, Jakub Przybylo, Mariusz Wozniak:
How to personalize the vertices of a graph? Eur. J. Comb. 40: 116-123 (2014) - 2013
- [j17]Rafal Kalinowski, Monika Pilsniak, Jakub Przybylo, Mariusz Wozniak:
Can Colour-Blind Distinguish Colour Palettes? Electron. J. Comb. 20(3): 23 (2013) - 2012
- [j16]Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak:
Preface. Discret. Math. 312(14): 2091 (2012) - [j15]Mieczyslaw Borowiecki, Jaroslaw Grytczuk
Coloring chip configurations on graphs and digraphs. Inf. Process. Lett. 112(1-2): 1-4 (2012) - 2011
- [j14]Monika Pilsniak, Mariusz Wozniak:
On packing of two copies of a hypergraph. Discret. Math. Theor. Comput. Sci. 13(3): 67-74 (2011) - 2010
- [j13]Agnieszka Görlich, Monika Pilsniak:
A note on an embedding problem in transitive tournaments. Discret. Math. 310(4): 681-686 (2010)
2000 – 2009
- 2009
- [j12]Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak, Irmina A. Ziolo:
Arbitrarily vertex decomposable suns with few rays. Discret. Math. 309(11): 3726-3732 (2009) - [j11]Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak, Irmina A. Ziolo:
On-line arbitrarily vertex decomposable suns. Discret. Math. 309(22): 6328-6336 (2009) - 2007
- [j10]Agnieszka Görlich, Rafal Kalinowski, Mariusz Meszka, Monika Pilsniak, Mariusz Wozniak:
A note on decompositions of transitive tournaments II. Australas. J Comb. 37: 57-66 (2007) - [j9]Agnieszka Görlich, Rafal Kalinowski, Mariusz Meszka, Monika Pilsniak, Mariusz Wozniak:
A note on decompositions of transitive tournaments. Discret. Math. 307(7-8): 896-904 (2007) - [j8]Monika Pilsniak:
Packing of two digraphs into a transitive tournament. Discret. Math. 307(7-8): 971-974 (2007) - [j7]Agnieszka Görlich, Monika Pilsniak, Mariusz Wozniak, Irmina A. Ziolo:
Fixed-point-free embeddings of digraphs with small size. Discret. Math. 307(11-12): 1332-1340 (2007) - [j6]Monika Pilsniak, Mariusz Wozniak:
A note on packing of two copies of a hypergraph. Discuss. Math. Graph Theory 27(1): 45-49 (2007) - 2006
- [j5]Agnieszka Görlich, Monika Pilsniak, Mariusz Wozniak:
A Note on a Packing Problem in Transitive Tournaments. Graphs Comb. 22(2): 233-239 (2006) - 2005
- [j4]Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak, Irmina A. Ziolo:
Some families of arbitrarily vertex decomposable graphs. Electron. Notes Discret. Math. 22: 451-454 (2005) - 2004
- [j3]Agnieszka Görlich, Monika Pilsniak, Mariusz Wozniak, Irmina A. Ziolo:
A note on embedding graphs without short cycles. Discret. Math. 286(1-2): 75-77 (2004) - [j2]Monika Pilsniak:
Packing of three copies of a digraph into the transitive tournament. Discuss. Math. Graph Theory 24(3): 443-456 (2004) - 2003
- [j1]Agnieszka Görlich, Monika Pilsniak, Mariusz Wozniak:
On cyclically embeddable (n, n)-graphs. Discuss. Math. Graph Theory 23(1): 85-104 (2003)
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-05-08 21:51 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: