Monika Pilśniak - Citegraph

Author Info

Name	Affiliation	Papers
MONIKA PILŚNIAK	Department of Applied Mathematics, AGH University of Science and Technology, Cracow, Poland	22
Collaborators	Citations	PageRank
22	28	9.31
Referers	Referees	References
30	82	78

Publications (22 rows)

Collaborators (22 rows)

Referers (30 rows)

Referees (82 rows)

Title	Citations	PageRank	Year
On a total version of 1,2,3 Conjecture	0	0.34	2020
The Distinguishing Index Of Connected Graphs Without Pendant Edges	0	0.34	2020
Asymmetric colorings of products of graphs and digraphs	0	0.34	2019
A note on breaking small automorphisms in graphs.	0	0.34	2017
The distinguishing index of the Cartesian product of finite graphs.	2	0.41	2017
Precise bounds for the distinguishing index of the Cartesian product.	0	0.34	2017
Bounds for Distinguishing Invariants of Infinite Graphs.	0	0.34	2017
Edge motion and the distinguishing index.	0	0.34	2017
Equitable neighbour-sum-distinguishing edge and total colourings.	2	0.38	2017
The distinguishing index of the Cartesian product of countable graphs.	0	0.34	2017
Improving upper bounds for the distinguishing index.	2	0.48	2017
Distinguishing Cartesian products of countable graphs.	3	0.47	2017
Distinguishing graphs by total colourings	1	0.41	2016
A note on an embedding problem in transitive tournaments	0	0.34	2010
Arbitrarily vertex decomposable suns with few rays	7	0.87	2009
On-line arbitrarily vertex decomposable suns	5	0.60	2009
Fixed-point-free embeddings of digraphs with small size	3	0.65	2007
A note on decompositions of transitive tournaments	0	0.34	2007
A Note On Decompositions Of Transitive Tournaments Ii	0	0.34	2007
Packing of two digraphs into a transitive tournament	1	0.37	2007
Some families of arbitrarily vertex decomposable graphs	0	0.34	2005
A note on embedding graphs without short cycles	2	0.61	2004