Robert Janczewski
Gdańsk University of Technology
26 Papers
56 Citations
Robert Janczewski is an academic researcher from Gdańsk University of Technology. The author has contributed to research in topics: Bipartite graph & Complete coloring. The author has an hindex of 6, co-authored 21 publications. Previous affiliations of Robert Janczewski include University of Gdańsk.
Chat about Author
Papers
The complexity of the L(p,q) -labeling problem for bipartite planar graphs of small degree
TL;DR: It is proved that if p 3q then the problem is NP-complete for bipartite planar graphs of maximum degree @D@?4 and t=p+5q, and that the L(p,q)-labeling problem in graphs ofmaximum degree@D @?4 isNP- complete for all values of p and q, thus answering two well-known open questions.
15
The complexity of the T -coloring problem for graphs with small degree
TL;DR: It is shown that the problem of T-coloring is polynomial on graphs with Δ ≤ 2 and in the case of k-regular graphs it becomes NP-hard even for every fixed T and every k > 3.
9
Note: Greedy T-colorings of graphs
TL;DR: This paper shows that greedy T-colorings of graphs produced by the greedy (or first-fit) algorithm have three nice properties: their span and edge span are equal, the number of colors they use is independent of T, and the set of colorsthey use is a function of T and theNumber of colors used, only.
7
A polynomial algorithm for finding T -span of generalized cacti
TL;DR: A new class of graphs is introduced which is large enough to contain paths, cycles, trees, cacti, polygon trees and connected outerplanar graphs and it is proved that the problem of computing the T-span for these graphs is polynomially solvable.
6
On Incidence Coloring of Complete Multipartite and Semicubic Bipartite Graphs
TL;DR: In the paper, it is proved that the incidence 4-coloring problem for semicubic bipartite graphs is 𝒩𝒫-complete, thus the 𝓂-completeness of L(1, 1)-labeling problem for chipmunk graphs is proved.