Projects funded by the NCN

Information on the principal investigator and host institution

Information of the project and the call

Keywords

Equipment

Delete all

Additive graph colourings

2014/13/B/ST1/01855

Keywords:

neighbour sum distinguishing index of a graph 1-2-3-Conjecture Zhang's Conjecture proper edge colouring total colouring list colouring graph irregularity strength probabilistic method Combinatorial Nullstellensatz discharging method colouring algorithms

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 hab. Jakub Przybyło 

Number of co-investigators in the project: 1

Call: OPUS 7 - announced on 2014-03-17

Amount awarded: 168 000 PLN

Project start date (Y-m-d): 2015-01-23

Project end date (Y-m-d): 2018-01-22

Project duration:: 36 months (the same as in the proposal)

Project status: Project settled

Equipment purchased [PL]

  1. notebook (przenośny komputer osobisty) (6 000 PLN)

Information in the final report

  • Publication in academic press/journals (16)
  1. Neighbour sum distinguishing total colourings via the Combinatorial Nullstellensatz
    Authors:
    J. Przybyło
    Academic press:
    Discrete Applied Mathematics (rok: 2016, tom: 202, strony: 163-173), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.dam.2015.08.028 - link to the publication
  2. On a directed variation of the 1-2-3 and 1-2 Conjectures
    Authors:
    E. Barme, J. Bensmail, J. Przybyło, M. Woźniak
    Academic press:
    Discrete Applied Mathematics (rok: 2017, tom: 217(2), strony: 123-131), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.dam.2016.08.013 - link to the publication
  3. On decomposing graphs of large minimum degree into locally irregular subgraphs
    Authors:
    J. Przybyło
    Academic press:
    Electronic Journal of Combinatorics (rok: 2016, tom: 23(2), strony: #P2.31), Wydawca: free web-based mathematics journal
    Status:
    Published
    DOI:
    brak - link to the publication
  4. On decomposing regular graphs into locally irregular subgraphs
    Authors:
    O. Baudon, J. Bensmail, J. Przybyło, M. Woźniak
    Academic press:
    European Journal of Combinatorics (rok: 2015, tom: 49, strony: 90-104), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.ejc.2015.02.031 - link to the publication
  5. On the neighbour sum distinguishing index of graphs with bounded maximum average degree
    Authors:
    H. Hocquard, J. Przybyło
    Academic press:
    Graphs and Combinatorics (rok: 2017, tom: 33, strony: 1459-1471), Wydawca: Springer
    Status:
    Published
    DOI:
    10.1007/s00373-017-1822-3 - link to the publication
  6. On the total neighbour sum distinguishing index of graphs with bounded maximum average degree
    Authors:
    H. Hocquard, J. Przybyło
    Academic press:
    Journal of Combinatorial Optimization , Wydawca: Springer
    Status:
    Submitted
    DOI:
    brak - link to the publication
  7. Asymptotically optimal neighbor sum distinguishing total colorings of graphs
    Authors:
    S. Loeb, J. Przybyło, Y. Tang
    Academic press:
    Discrete Mathematics (rok: 2017, tom: 340(2), strony: 58-62), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.disc.2016.08.012 - link to the publication
  8. Equitable neighbour-sum-distinguishing edge and total colourings
    Authors:
    O. Baudon, M. Pilśniak, J. Przybyło, M. Senhaji, É. Sopena, M. Woźniak
    Academic press:
    Discrete Applied Mathematics (rok: 2017, tom: 222, strony: 40-53), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.dam.2017.01.031 - link to the publication
  9. New bounds for locally irregular chromatic index of bipartite and subcubic graphs
    Authors:
    B. Lužar, J. Przybyło, R. Soták
    Academic press:
    Journal of Combinatorial Optimization (rok: 2018, tom: 36, strony: 1425-1438), Wydawca: Springer
    Status:
    Published
    DOI:
    10.1007/s10878-018-0313-7 - link to the publication
  10. A note on asymptotically optimal neighbour sum distinguishing colourings
    Authors:
    J. Przybyło
    Academic press:
    European Journal of Combinatorics (rok: 2019, tom: 77, strony: 49-56), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.009 - link to the publication
  11. Asymptotically optimal bound on the adjacent vertex distinguishing edge choice number
    Authors:
    J. Kwaśny, J. Przybyło
    Academic press:
    Random Structures & Algorithms (rok: 2019, tom: 54(4), strony: 768-778), Wydawca: Wiley
    Status:
    Published
    DOI:
    10.1002/rsa.20813 - link to the publication
  12. On locally irregular decompositions and the 1-2 Conjecture in digraphs
    Authors:
    O. Baudon, J. Bensmail, J. Przybyło, M Woźniak
    Academic press:
    Discrete Mathematics and Theoretical Computer Science (rok: 2018, tom: 20(2), strony: #7), Wydawca: open access scientic journal (Free Journal Network)
    Status:
    Published
    DOI:
    10.23638/DMTCS-20-2-7 - link to the publication
  13. A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions
    Authors:
    O. Baudon, J. Bensmail, T. Davot, H. Hocquard, J. Przybyło, M. Senhaji, É. Sopena, M. Woźniak
    Academic press:
    Discrete Mathematics and Theoretical Computer Science (rok: 2019, tom: 21(1), strony: #2), Wydawca: open access scientic journal (Free Journal Network)
    Status:
    Published
    DOI:
    brak - link to the publication
  14. Group twin coloring of graphs
    Authors:
    S. Cichacz, J. Przybyło
    Academic press:
    Discrete Mathematics and Theoretical Computer Science (rok: 2018, tom: 20(1), strony: #24), Wydawca: open access scientic journal (Free Journal Network)
    Status:
    Published
    DOI:
    10.23638/DMTCS-20-1-24 - link to the publication
  15. On the neighbor sum distinguishing index of planar graphs
    Authors:
    M. Bonamy, J. Przybyło
    Academic press:
    Journal of Graph Theory (rok: 2017, tom: 85, strony: 669-690), Wydawca: Wiley
    Status:
    Published
    DOI:
    10.1002/jgt.22098 - link to the publication
  16. On weight choosabilities of graphs with bounded maximum average degree
    Authors:
    J. Przybyło, A. Raspaud, M. Woźniak
    Academic press:
    Discrete Applied Mathematics (rok: 2017, tom: 217(3), strony: 663-672), Wydawca: Elsevier
    Status:
    Published
    DOI:
    10.1016/j.dam.2016.09.037 - 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