Computational aspects of greedy partitioning of graphs, 2018, Piotr Borowiecki(*) , Journal of Combinatorial Optimization, Vol. 35, 641--665, ISSN: 1382-6905, eISSN: 1573-2886, bibliogr. rys. summ.
Słowa kluczowe: Computational complexity, Graph coloring, Graph partitioning, Greedy algorithm, Grundy number, Minimal graphs
Kod: CZR-JCR BibTeX (pkt. 25) DOI: 10.1007/s10878-017-0185-2

Open Access: Licence: CC-BY, Article mode: OPEN_JOURNAL, Release time: AFTER_PUBLICATION, Text version: FINAL_PUBLISHED, Date of publication: 11-11-2017

Graphs with multiplicative vertex-coloring 2-edge-weightings, 2017, Joanna Skowronek-Kaziów , Journal of Combinatorial Optimization, Vol. 33, iss. 1, 333--338, ISSN: 1382-6905, eISSN: 1573-2886, bibliogr. summ.
Słowa kluczowe: 1-2-3 Conjecture, Edge weighting, Vertex coloring
Kod: CZR-JCR BibTeX (pkt. 25) DOI: 10.1007/s10878-015-9966-7

Open Access: Licence: CC-BY, Article mode: OPEN_JOURNAL, Release time: AFTER_PUBLICATION, Text version: FINAL_PUBLISHED, Date of publication: 20-10-2015