1 citations · 1 across the 4 of their papers we have counts for
12 papers
How to Construct High Barrycades
Jakub Binięda, Michał Dębski, Grzegorz Gutowski +1
Given two positive integers height and order , the barrycade construction problem asks for a set of permutations of the integers from to such that all the proper…
Coloring and Recognizing Directed Interval Graphs
Grzegorz Gutowski, Konstanty Junosza-Szaniawski, Felix Klesen +3
A \emph{mixed interval graph} is an interval graph that has, for every pair of intersecting intervals, either an arc (directed arbitrarily) or an (undirected) edge. We are particul…
Coloring Mixed and Directional Interval Graphs
Grzegorz Gutowski, Florian Mittelstädt, Ignaz Rutter +3
A mixed graph has a set of vertices, a set of undirected egdes, and a set of directed arcs. A proper coloring of a mixed graph is a function that assigns to each vertex in…
Mrs. Correct and Majority Colorings
Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk +3
A majority coloring of a directed graph is a vertex coloring in which each vertex has the same color as at most half of its out-neighbors. In this note we simplify some proof techn…
On a Problem of Steinhaus
Marcin Anholcer, Bartłomiej Bosek, Jarosław Grytczuk +4
Let be a positive integer. A sequence of points in the unit interval is piercing if $\{x_1,x_2,\ldots,x_n\}\cap \left[\frac{i}{n},\frac{i+1}{n}…
Graph Polynomials and Group Coloring of Graphs
Bartłomiej Bosek, Jarosław Grytczuk, Grzegorz Gutowski +2
Let be an Abelian group and let be a simple graph. We say that is -colorable if for some fixed orientation of and every edge labeling , t…