On some Ramsey Numbers for Quadrilaterals. - Janusz Dybizbanski; Tomasz Dzido (Electron. J. Comb., 2011)

Three Color Ramsey Numbers for Graphs with at most 4 Vertices. - Luis Boza; Janusz Dybizbanski; Tomasz Dzido (Electron. J. Comb., 2012)

Sequences Containing No 3-Term Arithmetic Progressions. - Janusz Dybizbanski (Electron. J. Comb., 2012)

Oriented chromatic number of grids is greater than 7. - Janusz Dybizbanski; Anna Nenca (Inf. Process. Lett., 2012)

Unique Sequences Containing No k-Term Arithmetic Progressions. - Tanbir Ahmed; Janusz Dybizbanski; Hunter S. Snevily (Electron. J. Comb., 2013)

On Some Ramsey Numbers for Quadrilaterals Versus Wheels. - Janusz Dybizbanski; Tomasz Dzido (Graphs Comb., 2014)

The oriented chromatic number of Halin graphs. - Janusz Dybizbanski; Andrzej Szepietowski (Inf. Process. Lett., 2014)

On Some Zarankiewicz Numbers and Bipartite Ramsey Numbers for Quadrilateral. - Janusz Dybizbanski; Tomasz Dzido; Stanislaw P. Radziszowski (Ars Comb., 2015)

On some three-color Ramsey numbers for paths. - Janusz Dybizbanski; Tomasz Dzido; Stanislaw P. Radziszowski (Discret. Appl. Math., 2016)

Hamiltonian paths in hypercubes with local traps. - Janusz Dybizbanski; Andrzej Szepietowski (Inf. Sci., 2017)

A lower bound on the hypergraph Ramsey number R(4, 5;3). - Janusz Dybizbanski (Contributions Discret. Math., 2018)

Hamiltonian cycles in hypercubes with faulty edges. - Janusz Dybizbanski; Andrzej Szepietowski (Int. J. Comput. Math. Comput. Syst. Theory, 2018)

Signified chromatic number of grids is at most 9. - Janusz Dybizbanski (CoRR, 2019)

Oriented chromatic number of Cartesian products and strong products of paths. - Janusz Dybizbanski; Anna Nenca (Discuss. Math. Graph Theory, 2019)

Vizing-Goldberg type bounds for the equitable chromatic number of block graphs. - Janusz Dybizbanski; Hanna Furmanczyk; Vahan Mkrtchyan (CoRR, 2020)

On-line Ramsey numbers for paths and short cycles. - Janusz Dybizbanski; Tomasz Dzido; Renata Zakrzewska (Discret. Appl. Math., 2020)

Oriented cliques and colorings of graphs with low maximum degree. - Janusz Dybizbanski; Pascal Ochem; Alexandre Pinlou; Andrzej Szepietowski (Discret. Math., 2020)

2-Edge-Colored Chromatic Number of Grids is at Most 9. - Janusz Dybizbanski (Graphs Comb., 2020)

Signed coloring of 2-dimensional grids. - Janusz Dybizbanski; Anna Nenca; Andrzej Szepietowski (Inf. Process. Lett., 2020)

Hamiltonian cycles and paths in hypercubes with disjoint faulty edges. - Janusz Dybizbanski; Andrzej Szepietowski (Inf. Process. Lett., 2021)

Coloring Graphs in Oriented Coloring of Cubic Graphs. - Janusz Dybizbanski (Graphs Comb., 2022)

Equitable oriented coloring. - Janusz Dybizbanski (J. Graph Theory, 2023)

Low-degree spanning trees of 2-edge-connected graphs in linear time. - Dariusz Dereniowski; Janusz Dybizbanski; Przemyslaw Karpinski; Michal Zakrzewski; Pawel Zylinski (CoRR, 2024)

Gap one bounds for the equitable chromatic number of block graphs. - Janusz Dybizbanski; Hanna Furmanczyk; Vahan Mkrtchyan (Discret. Appl. Math., 2024)