#### Filter Results:

- Full text PDF available (10)

#### Publication Year

1997

2017

- This year (1)
- Last 5 years (10)
- Last 10 years (15)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Piotr Borowiecki, Kristína Budajová, Stanislav Jendrol, Stanislav Krajci
- Discussiones Mathematicae Graph Theory
- 2011

A parity path in a vertex colouring of a graph is a path along which each colour is used an even number of times. Let χp(G) be the least number of colours in a proper vertex colouring of G having no parity path. It is proved that for any graph G we have the following tight bounds χ(G) ≤ χp(G) ≤ |V (G)| − α(G) + 1, where χ(G) and α(G) are the chromatic… (More)

- Piotr Borowiecki, Frank Göring, Jochen Harant, Dieter Rautenbach
- Journal of Graph Theory
- 2012

The well-known lower bound on the independence number of a graph due to Caro (New Results on the Independence Number, Technical Report, TelAviv University, 1979) and Wei (A Lower Bound on the Stability Number of a Simple Graph, Technical memorandum, TM 81 11217 9, Bell laboratories, 1981) can be established as a performance guarantee of two natural and… (More)

- Piotr Borowiecki, Elzbieta Sidorowicz
- Fundam. Inform.
- 2012

Dynamics is an inherent feature of many real life systems so it’s natural to define and investigate the properties of models that reflect dynamic aspects of systems. In this talk we investigate the dynamic approach to the problem of graph coloring, which is well known and widely used in system modeling. In the dynamic setting of the problem, the graph we… (More)

- Piotr Borowiecki, Frank Göring
- SOFSEM
- 2011

- Piotr Borowiecki, Shantanu Das, Dariusz Dereniowski, Lukasz Kuszner
- SIROCCO
- 2016

We consider the problem of efficient evacuation using multiple exits. We formulate this problem as a discrete problem on graphs where mobile agents located in distinct nodes of a given graph must quickly reach one of multiple possible exit nodes, while avoiding congestion and bottlenecks. Each node of the graph has the capacity of holding at most one agent… (More)

- Piotr Borowiecki, Jaroslav Ivanco
- Discussiones Mathematicae Graph Theory
- 1997

We prove that for any two minor hereditary properties P1 and P2, such that P2 covers P1, and for any graph G ∈ P2 there is a P1bipartition of G. Some remarks on minimal reducible bounds are also included.

- Piotr Borowiecki, Dariusz Dereniowski, Lukasz Kuszner
- Distributed Computing
- 2014

In this work we consider the edge searching problem for vertex-weighted graphs with arbitrarily fast and invisible fugitive. The weight function $${\omega }$$ ω provides for each vertex $$v$$ v the minimum number of searchers required to guard $$v$$ v , i.e., the fugitive may not pass through $$v$$ v without being detected only if at least $${\omega }(v)$$… (More)

- Piotr Borowiecki, Dieter Rautenbach
- Discrete Applied Mathematics
- 2015

- Piotr Borowiecki
- FAW
- 2017

- Piotr Borowiecki, Dariusz Dereniowski
- Discrete Mathematics & Theoretical Computer…
- 2013

A vertex ranking of a graph G is an assignment of positive integers (colors) to the vertices of G such that each path connecting two vertices of the same color contains a vertex of a higher color. Our main goal is to find a vertex ranking using as few colors as possible. Considering on-line algorithms for vertex ranking of split graphs, we prove that the… (More)