| Publication | Date of Publication | Type |
|---|
| Edge coloring of products of signed graphs | 2023-12-05 | Paper |
Edge coloring of graphs of signed class 1 and 2
Discrete Applied Mathematics | 2023-08-02 | Paper |
Weighted 2-sections and hypergraph reconstruction
Theoretical Computer Science | 2022-05-31 | Paper |
Infinite chromatic games
Discrete Applied Mathematics | 2022-01-13 | Paper |
\(T\)-colorings, divisibility and the circular chromatic number
Discussiones Mathematicae Graph Theory | 2021-02-10 | Paper |
2-coloring number revisited
Theoretical Computer Science | 2019-11-13 | Paper |
On incidence coloring of complete multipartite and semicubic bipartite graphs
Discussiones Mathematicae Graph Theory | 2018-01-10 | Paper |
An \(O(n\log n)\) algorithm for finding edge span of cacti
Journal of Combinatorial Optimization | 2016-05-11 | Paper |
On the hardness of computing span of subcubic graphs
Information Processing Letters | 2015-11-05 | Paper |
The backbone coloring problem for bipartite backbones
Graphs and Combinatorics | 2015-09-24 | Paper |
The computational complexity of the backbone coloring problem for planar graphs with connected backbones
Discrete Applied Mathematics | 2015-04-28 | Paper |
Interval incidence graph coloring
Discrete Applied Mathematics | 2015-02-06 | Paper |
The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones
Information Processing Letters | 2014-12-09 | Paper |
Interval incidence coloring of bipartite graphs
Discrete Applied Mathematics | 2014-02-18 | Paper |
Consensus models: computational complexity aspects in modern approaches to the list coloring problem
Theoretical Computer Science | 2011-09-12 | Paper |
On efficient coloring of chordless graphs
Decision Making in Manufacturing and Services | 2010-10-01 | Paper |
The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree
Discrete Mathematics | 2009-06-23 | Paper |
Greedy \(T\)-colorings of graphs
Discrete Mathematics | 2009-06-17 | Paper |
Sum coloring of bipartite graphs with bounded degree
Algorithmica | 2004-11-05 | Paper |
A polynomial algorithm for finding \(T\)-span of generalized cacti
Discrete Applied Mathematics | 2003-09-09 | Paper |
The complexity of the \(T\)-coloring problem for graphs with small degree
Discrete Applied Mathematics | 2003-09-09 | Paper |
| scientific article; zbMATH DE number 1947053 (Why is no real title available?) | 2003-07-07 | Paper |
The smallest hard-to-color graph for algorithm DSATUR
Discrete Mathematics | 2002-12-02 | Paper |
Divisibility and \(T\)-span of graphs
Discrete Mathematics | 2002-11-17 | Paper |
