Michal Debski

Orcid: 0000-0001-9606-6052

According to our database1, Michal Debski authored at least 27 papers between 2012 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Edge colorings avoiding patterns.
Eur. J. Comb., March, 2024

Extensions and reductions of squarefree words.
Discret. Math., March, 2024

2022
Faster 3-Coloring of Small-Diameter Graphs.
SIAM J. Discret. Math., September, 2022

Conflict-free chromatic number versus conflict-free chromatic index.
J. Graph Theory, 2022

Fractional meanings of nonrepetitiveness.
J. Comb. Theory A, 2022

Strong edge coloring of circle graphs.
Eur. J. Comb., 2022

Computing Homomorphisms in Hereditary Graph Classes: The Peculiar Case of the 5-Wheel and Graphs with No Long Claws.
Proceedings of the 33rd International Symposium on Algorithms and Computation, 2022

2021
t-Strong Cliques and the Degree-Diameter Problem.
SIAM J. Discret. Math., 2021

Strong Cliques in Claw-Free Graphs.
Graphs Comb., 2021

2020
Avoiding Multiple Repetitions in Euclidean Spaces.
SIAM J. Discret. Math., 2020

Strong chromatic index of K1, t-free graphs.
Discret. Appl. Math., 2020

Bundling all shortest paths.
Discret. Appl. Math., 2020

Improved bounds for centered colorings.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Strong chromatic index of unit distance graphs.
J. Graph Theory, 2019

2018
Achromatic and Harmonious Colorings of Circulant Graphs.
J. Graph Theory, 2018

Graph coloring and Graham's greatest common divisor problem.
Discret. Math., 2018

2017
On avoding r-repetitions in ℝ<sup>2</sup>.
Electron. Notes Discret. Math., 2017

Fractional strong chromatic index of bipartite graphs.
Discret. Math., 2017

Sequences of radius k for complete bipartite graphs.
Discret. Appl. Math., 2017

Web-Enabled Discovery and Launch.
Proceedings of the 15th International Conference on Advances in Mobile Computing & Multimedia, 2017

2016
Universal Cycle Packings and Coverings for k-Subsets of an n-Set.
Graphs Comb., 2016

Grasshopper Avoidance of Patterns.
Electron. J. Comb., 2016

2015
The strong chromatic index of sparse graphs.
Inf. Process. Lett., 2015

Harmonious and achromatic colorings of fragmentable hypergraphs.
Electron. Notes Discret. Math., 2015

On a topological relaxation of a conjecture of Erdős and Nešetřil.
Eur. J. Comb., 2015

2014
Sequences of large radius.
Eur. J. Comb., 2014

2012
Perfect matchings in antipodally colored lattice of subsets.
Discret. Math., 2012


  Loading...