#### Filter Results:

#### Publication Year

2007

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Sylwia Cichacz-Przenioslo, Dalibor Froncek, Petr Kovár
- IWOCA
- 2009

- Dalibor Froncek, Petr Kovár, Tereza Kovarova, Michael Kubesa
- Discrete Mathematics
- 2010

- Sergei L. Bezrukov, Dalibor Froncek, Steven J. Rosenberg, Petr Kovár
- Discrete Mathematics
- 2008

It was proved by Fronček, Jerebic, Klavžar, and Kovář that if a complete bi-partite graph K n,n with a perfect matching removed can be covered by k bicliques, then n ≤ k k 2. We give a slightly simplified proof and we show that the result is tight. Moreover we use the result to prove analogous bounds for coverings of some other classes of graphs by… (More)

- Dalibor Froncek, Janja Jerebic, Sandi Klavzar, Petr Kovár
- Combinatorics, Probability & Computing
- 2007

The strong isometric dimension of a graph G is the least number k such that G isometrically embeds into the strong product of k paths. Using Sperner's Theorem, the strong isometric dimension of the Hamming graphs K 2 K n is determined.

- Petr Kovár, Michael Kubesa
- IWOCA
- 2009

Let G(V, E) be a graph and λ be a bijection from the set V ∪ E to the set of the first |V | + |E| natural numbers. The weight of a vertex is the sum of its label and the labels of all adjacent edges. We say λ is a vertex magic total (VMT) labeling of G if the weight of each vertex is constant. We say λ is an (s, d)-vertex antimagic total (VAT) labeling if… (More)

- Petr Gregor, Petr Kovár
- Electronic Notes in Discrete Mathematics
- 2013

- Petr Kovár, Michael Kubesa, Mariusz Meszka
- Discrete Mathematics
- 2012

Let G = (V, E) be a graph on n vertices. A bijection f : V → {1, 2,. .. , n} is called a distance magic labeling of G if there exists an integer k such that u∈N (v) f (u) = k for all v ∈ V , where N(v) is the set of all vertices adjacent to v. The constant k is the magic constant of f and any graph which admits a distance magic labeling is a distance magic… (More)

- Dalibor Froncek, Petr Kovár, Michael Kubesa
- Discrete Mathematics
- 2010