2023
Edge coloring of graphs of signed class 1 and 2.
Discret. Appl. Math., October, 2023

Edge coloring of products of signed graphs.
CoRR, 2023

2022
Weighted 2-sections and hypergraph reconstruction.
Theor. Comput. Sci., 2022

Infinite chromatic games.
Discret. Appl. Math., 2022

2021
<i>T</i>-colorings, divisibility and circular chromatic number.
Discuss. Math. Graph Theory, 2021

2019
2-Coloring number revisited.
Theor. Comput. Sci., 2019

2018
On incidence coloring of complete multipartite and semicubic bipartite graphs.
Discuss. Math. Graph Theory, 2018

2016
An O(n log n) algorithm for finding edge span of cacti.
J. Comb. Optim., 2016

On the hardness of computing span of subcubic graphs.
Inf. Process. Lett., 2016

2015
The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones.
Inf. Process. Lett., 2015

The Backbone Coloring Problem for Bipartite Backbones.
Graphs Comb., 2015

The computational complexity of the backbone coloring problem for planar graphs with connected backbones.
Discret. Appl. Math., 2015

Interval incidence graph coloring.
Discret. Appl. Math., 2015

2014
Interval incidence coloring of bipartite graphs.
Discret. Appl. Math., 2014

2011
Consensus models: Computational complexity aspects in modern approaches to the list coloring problem.
Theor. Comput. Sci., 2011

2009
The complexity of the L(p, q)-labeling problem for bipartite planar graphs of small degree.
Discret. Math., 2009

Greedy T-colorings of graphs.
Discret. Math., 2009

Interval Wavelength Assignment in All-Optical Star Networks.
Proceedings of the Parallel Processing and Applied Mathematics, 2009

2004
Sum Coloring of Bipartite Graphs with Bounded Degree.
Algorithmica, 2004

2003
A polynomial algorithm for finding T-span of generalized cacti.
Discret. Appl. Math., 2003

The complexity of the T-coloring problem for graphs with small degree.
Discret. Appl. Math., 2003

2002
A 27/26-Approximation Algorithm for the Chromatic Sum Coloring of Bipartite Graphs.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

2001
The smallest hard-to-color graph for algorithm DSATUR.
Discret. Math., 2001

Divisibility and <i>T</i>-span of graphs.
Discret. Math., 2001