7 citations · 12 across the 12 of their papers we have counts for
4 papers · 1 filter
Generalizing Brooks' theorem via Partial Coloring is Hard Classically and Locally
Jan Bok, Avinandan Das, Anna Gujgiczer +1
We investigate the classical and distributed complexity of \emph{-partial -coloring} where , a natural generalization of Brooks' theorem where each vertex should be colo…
Computational complexity of covering regular trees
Jan Bok, Jiří Fiala, Nikola Jedličková +1
A graph covering projection, also referred to as a locally bijective homomorphism, is a mapping between the vertices and edges of two graphs that preserves incidences and is a loca…
On the expressive power of -edge-colourings of graphs
Jan Bok, Santiago Guzmán-Pro, Nikola Jedličková +1
Given a finite set of -edge-coloured graphs and a hereditary property of graphs , we say that expresses if a graph has t…
Computational Complexity of Covering Colored Mixed Multigraphs with Simple Degree Partitions
Jan Bok, Jiří Fiala, Nikola Jedličková +2
The notion of graph covers (also referred to as locally bijective homomorphisms) plays an important role in topological graph theory and has found its computer science applications…