We stand with Ukraine  

Janusz Dybizbanski

Orcid: 0000-0002-2575-4373

According to our database1, Janusz Dybizbanski authored at least 23 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Gap one bounds for the equitable chromatic number of block graphs.
[BibTeX]
[DOI]
Janusz Dybizbanski
,
Hanna Furmanczyk
,
Vahan Mkrtchyan
Discret. Appl. Math., 2024

2023
Equitable oriented coloring.
[BibTeX]
[DOI]
Janusz Dybizbanski
J. Graph Theory, September, 2023

2022
Coloring Graphs in Oriented Coloring of Cubic Graphs.
[BibTeX]
[DOI]
Janusz Dybizbanski
Graphs Comb., 2022

2021
Hamiltonian cycles and paths in hypercubes with disjoint faulty edges.
[BibTeX]
[DOI]
Janusz Dybizbanski
,
Andrzej Szepietowski
Inf. Process. Lett., 2021

2020
Signed coloring of 2-dimensional grids.
[BibTeX]
[DOI]
Janusz Dybizbanski
,
Anna Nenca
,
Andrzej Szepietowski
Inf. Process. Lett., 2020

2-Edge-Colored Chromatic Number of Grids is at Most 9.
[BibTeX]
[DOI]
Janusz Dybizbanski
Graphs Comb., 2020

Oriented cliques and colorings of graphs with low maximum degree.
[BibTeX]
[DOI]
Janusz Dybizbanski
,
Pascal Ochem
,
Alexandre Pinlou
,
Andrzej Szepietowski
Discret. Math., 2020

On-line Ramsey numbers for paths and short cycles.
[BibTeX]
[DOI]
Janusz Dybizbanski
,
Tomasz Dzido
,
Renata Zakrzewska
Discret. Appl. Math., 2020

Vizing-Goldberg type bounds for the equitable chromatic number of block graphs.
[BibTeX]
[DOI]
Janusz Dybizbanski
,
Hanna Furmanczyk
,
Vahan Mkrtchyan
CoRR, 2020

2019
Oriented chromatic number of Cartesian products and strong products of paths.
[BibTeX]
[DOI]
Janusz Dybizbanski
,
Anna Nenca
Discuss. Math. Graph Theory, 2019

Signified chromatic number of grids is at most 9.
[BibTeX]
[DOI]
Janusz Dybizbanski
CoRR, 2019

2018
Hamiltonian cycles in hypercubes with faulty edges.
[BibTeX]
[DOI]
Janusz Dybizbanski
,
Andrzej Szepietowski
Int. J. Comput. Math. Comput. Syst. Theory, 2018

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

2017
Hamiltonian paths in hypercubes with local traps.
[BibTeX]
[DOI]
Janusz Dybizbanski
,
Andrzej Szepietowski
Inf. Sci., 2017

2016
On some three-color Ramsey numbers for paths.
[BibTeX]
[DOI]
Janusz Dybizbanski
,
Tomasz Dzido
,
Stanislaw P. Radziszowski
Discret. Appl. Math., 2016

2015
On Some Zarankiewicz Numbers and Bipartite Ramsey Numbers for Quadrilateral.
[BibTeX]
Janusz Dybizbanski
,
Tomasz Dzido
,
Stanislaw P. Radziszowski
Ars Comb., 2015

2014
The oriented chromatic number of Halin graphs.
[BibTeX]
[DOI]
Janusz Dybizbanski
,
Andrzej Szepietowski
Inf. Process. Lett., 2014

On Some Ramsey Numbers for Quadrilaterals Versus Wheels.
[BibTeX]
[DOI]
Janusz Dybizbanski
,
Tomasz Dzido
Graphs Comb., 2014

2013
Unique Sequences Containing No k-Term Arithmetic Progressions.
[BibTeX]
[DOI]
Tanbir Ahmed
,
Janusz Dybizbanski
,
Hunter S. Snevily
Electron. J. Comb., 2013

2012
Oriented chromatic number of grids is greater than 7.
[BibTeX]
[DOI]
Janusz Dybizbanski
,
Anna Nenca
Inf. Process. Lett., 2012

Sequences Containing No 3-Term Arithmetic Progressions.
[BibTeX]
[DOI]
Janusz Dybizbanski
Electron. J. Comb., 2012

Three Color Ramsey Numbers for Graphs with at most 4 Vertices.
[BibTeX]
[DOI]
Luis Boza
,
Janusz Dybizbanski
,
Tomasz Dzido
Electron. J. Comb., 2012

2011
On some Ramsey Numbers for Quadrilaterals.
[BibTeX]
[DOI]
Janusz Dybizbanski
,
Tomasz Dzido
Electron. J. Comb., 2011


  Loading...