Vertex distinguishing graph colourings
2011/01/D/ST1/04154
Keywords
Descriptors
- ST1_14: Kombinatoryka
Panel
ST1 – Mathematics: all areas of mathematics, pure and applied, as well as mathematical foundations of computer science, physics and statistics
Host institution
Akademia Górniczo-Hutnicza im. Stanisława Staszica w Krakowie, Wydział Matematyki Stosowanej
Voivodeship: małopolskie
Principal investigator (from the host institution)
Number of co-investigators in the project: 1
Call
SONATA 1 – announced on 2011-03-15
- Amount awarded
- 126 000 PLN
- Project start date
- 2011-12-01
- Project end date
- 2014-11-30
- Project duration
- 36 months (the same as in the proposal)
- Project status
- Project settled
Information in the final report
Publication in academic press/journals (10)
-
Neighbor distinguishing edge colorings via the Combinatorial Nullstellensatz
- Authors:
- J. Przybyło
- Academic press:
- SIAM Journal on Discrete Mathematics (year: 2013, volume: 27(3), pages: 1313-1322), Publisher: Society for Industrial and Applied Mathematics
- Status:
- Published
- DOI:
- 10.1137/120880586 – link to the publication
-
Distant irregularity strength of graphs
- Authors:
- J. Przybyło
- Academic press:
- Discrete Mathematics (year: 2013, volume: 313(24), pages: 2875-2880), Publisher: Elsevier
- Status:
- Published
- DOI:
- 10.1016/j.disc.2013.08.031 – link to the publication
-
Neighbor distinguishing edge colorings via the Combinatorial Nullstellensatz revisited
- Authors:
- J. Przybyło, T-L. Wong
- Academic press:
- Journal of Graph Theory (year: 2015, volume: 80, pages: 299-312), Publisher: Wiley
- Status:
- Published
- DOI:
- 10.1002/jgt.21852 – link to the publication
-
On the irregularity strength of dense graphs
- Authors:
- P. Majerski, J. Przybyło
- Academic press:
- SIAM Journal on Discrete Mathematics (year: 2014, volume: 28(1), pages: 197-205), Publisher: Society for Industrial and Applied Mathematics
- Status:
- Published
- DOI:
- 10.1137/120886650 – link to the publication
-
Can colour-blind distinguish colour palletes?
- Authors:
- R. Kalinowski, M. Pilśniak, J. Przybyło, M. Woźniak
- Academic press:
- Electronic Journal of Combinatorics (year: 2013, volume: 20(3), pages: P23), Publisher: University of Delaware and Open source publishing system
- Status:
- Published
- DOI:
- link to the publication
-
Asymptotically optimal neighbour sum distinguishing colourings of graphs
- Authors:
- J. Przybyło
- Academic press:
- Random Structures & Algorithms (year: 2015, volume: 47, pages: 776-791), Publisher: Wiley
- Status:
- Published
- DOI:
- 10.1002/rsa.20553 – link to the publication
-
Colour-blind can distinguish colour pallets
- Authors:
- J. Przybyło
- Academic press:
- Electronic Journal of Combinatorics (year: 2014, volume: 21(2), pages: P2.19), Publisher: University of Delaware and Open source publishing system
- Status:
- Published
- DOI:
- link to the publication
-
On colour-blind distinguishing colour pallets in regular graphs
- Authors:
- J. Przybyło
- Academic press:
- Journal of Combinatorial Optimization (year: 2014, volume: 28(2), pages: 348-357), Publisher: Springer
- Status:
- Published
- DOI:
- 10.1007/s10878-012-9556-x – link to the publication
-
Total vertex irregularity strength of dense graphs
- Authors:
- P. Majerski, J.Przybyło
- Academic press:
- Journal of Graph Theory (year: 2014, volume: 76(1), pages: 34-41), Publisher: Wiley
- Status:
- Published
- DOI:
- 10.1002/jgt.21748 – link to the publication
-
A note on adjacent vertex distinguishing colorings of graphs
- Authors:
- M. Axenovich, J. Harant, J. Przybyło, R. Soták, M. Voigt, J. Weidelich
- Status:
- Accepted for publication