Projects funded by the NCN

Information on the principal investigator and host institution

Information of the project and the call

Keywords

Equipment

Delete all

Vertex distinguishing graph colourings

2011/01/D/ST1/04154

Keywords:

Combinatorial Nullstellensatz probabilistic method neighbour set (sum) distinguishing edge colouring irregular colouring irregularity strength total vertex irregularity strength 1,2,3 Conjecture 1,2 Conjecture distance irregular colourings list edge colouring

Descriptors:

  • ST1_14: Discrete mathematics and combinatorics

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

woj. małopolskie

Other projects carried out by the institution 

Principal investigator (from the host institution):

dr Jakub Przybyło 

Number of co-investigators in the project: 1

Call: SONATA 1 - announced on 2011-03-15

Amount awarded: 126 000 PLN

Project start date (Y-m-d): 2011-12-01

Project end date (Y-m-d): 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)
  1. Asymptotically optimal neighbour sum distinguishing colourings of graphs
    Authors:
    J. Przybyło
    Academic press:
    Random Structures & Algorithms (rok: 2015, tom: 47, strony: 776-791), Wydawca: Wiley
    Status:
    Published
    DOI:
    10.1002/rsa.20553 - link to the publication
  2. Colour-blind can distinguish colour pallets
    Authors:
    J. Przybyło
    Academic press:
    Electronic Journal of Combinatorics (rok: 2014, tom: 21(2), strony: P2.19), Wydawca: University of Delaware and Open source publishing system
    Status:
    Published
    DOI:
    brak - link to the publication
  3. On colour-blind distinguishing colour pallets in regular graphs
    Authors:
    J. Przybyło
    Academic press:
    Journal of Combinatorial Optimization (rok: 2014, tom: 28(2), strony: 348-357), Wydawca: Springer
    Status:
    Published
    DOI:
    10.1007/s10878-012-9556-x - link to the publication
  4. Neighbor distinguishing edge colorings via the Combinatorial Nullstellensatz revisited
    Authors:
    J. Przybyło, T-L. Wong
    Academic press:
    Journal of Graph Theory (rok: 2015, tom: 80, strony: 299-312), Wydawca: Wiley
    Status:
    Published
    DOI:
    10.1002/jgt.21852 - link to the publication
  5. Neighbor distinguishing edge colorings via the Combinatorial Nullstellensatz
    Authors:
    J. Przybyło
    Academic press:
    SIAM Journal on Discrete Mathematics (rok: 2013, tom: 27(3), strony: 1313-1322), Wydawca: Society for Industrial and Applied Mathematics
    Status:
    Published
    DOI:
    10.1137/120880586 - link to the publication
  6. Total vertex irregularity strength of dense graphs
    Authors:
    P. Majerski, J.Przybyło
    Academic press:
    Journal of Graph Theory (rok: 2014, tom: 76(1), strony: 34-41), Wydawca: Wiley
    Status:
    Published
    DOI:
    10.1002/jgt.21748 - link to the publication
  7. Can colour-blind distinguish colour palletes?
    Authors:
    R. Kalinowski, M. Pilśniak, J. Przybyło, M. Woźniak
    Academic press:
    Electronic Journal of Combinatorics (rok: 2013, tom: 20(3), strony: P23), Wydawca: University of Delaware and Open source publishing system
    Status:
    Published
    DOI:
    brak - link to the publication
  8. Distant irregularity strength of graphs
    Authors:
    J. Przybyło
    Academic press:
    Discrete Mathematics (rok: 2013, tom: 313(24), strony: 2875-2880), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.disc.2013.08.031 - link to the publication
  9. On the irregularity strength of dense graphs
    Authors:
    P. Majerski, J. Przybyło
    Academic press:
    SIAM Journal on Discrete Mathematics (rok: 2014, tom: 28(1), strony: 197-205), Wydawca: Society for Industrial and Applied Mathematics
    Status:
    Published
    DOI:
    10.1137/120886650 - link to the publication
  10. A note on adjacent vertex distinguishing colorings of graphs
    Authors:
    M. Axenovich, J. Harant, J. Przybyło, R. Soták, M. Voigt, J. Weidelich
    Academic press:
    Discrete Applied Mathematics (rok: 2016, tom: 205, strony: 45298), Wydawca: Elsevier
    Status:
    Accepted for publication
    DOI:
    10.1016/j.dam.2015.12.005 - link to the publication

O Narodowym Centrum Nauki

Finansowanie nauki

Współpraca zagraniczna

Centrum prasowe

Deklaracja dostępności
Przetwarzanie danych osobowych
Polityka cookies

Partnerzy