R. Janczewski

Available identifiers

zbMath Open janczewski.robertMaRDI QIDQ186209

List of research outcomes

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	2023-08-02	Paper
Weighted 2-sections and hypergraph reconstruction	2022-05-31	Paper
Infinite chromatic games	2022-01-13	Paper
\(T\)-colorings, divisibility and the circular chromatic number	2021-02-10	Paper
2-coloring number revisited	2019-11-13	Paper
On incidence coloring of complete multipartite and semicubic bipartite graphs	2018-01-10	Paper
An \(O(n\log n)\) algorithm for finding edge span of cacti	2016-05-11	Paper
On the hardness of computing span of subcubic graphs	2015-11-05	Paper
The backbone coloring problem for bipartite backbones	2015-09-24	Paper
The computational complexity of the backbone coloring problem for planar graphs with connected backbones	2015-04-28	Paper
Interval incidence graph coloring	2015-02-06	Paper
The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones	2014-12-09	Paper
Interval incidence coloring of bipartite graphs	2014-02-18	Paper
Consensus models: computational complexity aspects in modern approaches to the list coloring problem	2011-09-12	Paper
On Efficient Coloring of Chordless Graphs	2010-10-01	Paper
The complexity of the \(L(p,q)\)-labeling problem for bipartite planar graphs of small degree	2009-06-23	Paper
Greedy \(T\)-colorings of graphs	2009-06-17	Paper
Sum coloring of bipartite graphs with bounded degree	2004-11-05	Paper
A polynomial algorithm for finding \(T\)-span of generalized cacti	2003-09-09	Paper
The complexity of the \(T\)-coloring problem for graphs with small degree	2003-09-09	Paper
https://portal.mardi4nfdi.de/entity/Q4411283	2003-07-07	Paper
The smallest hard-to-color graph for algorithm DSATUR	2002-12-02	Paper
Divisibility and \(T\)-span of graphs	2002-11-17	Paper

Research outcomes over time

This page was built for person: R. Janczewski