Mirko Hornák

dblp:46/1727 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
1since 2021 · last 2021
0000-0002-3588-8455ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 5 · 2 first-author · 1 since 2021
YearPublicationVenuePosition
2021 Facial unique-maximum edge and total coloring of plane graphs
Igor Fabrici, Mirko Hornák, Simona Rindosová
Discret. Appl. Math.2
2018 A note on a directed version of the 1-2-3 Conjecture
Mirko Hornák, Jakub Przybylo, Mariusz Wozniak
Discret. Appl. Math.1
2014 On the maximum weight of a planar graph of given order and size
Andrej Gajdos, Mirko Hornák, Peter Hudák, Tomás Madaras
Discret. Appl. Math.2
2007 On-line arbitrarily vertex decomposable trees
Mirko Hornák, Zsolt Tuza, Mariusz Wozniak
Discret. Appl. Math.1
2001 Cyclic Chromatic Number of 3-Connected Plane Graphs
abstract
Let G be a 3-connected plane graph. Plummer and Toft [ J. Graph Theory, 11 (1987), pp. 507--515] conjectured that $\chi_{c}(G) \leq \Delta^{*}(G) + 2$, where $\chi_{c}(G)$ is the cyclic chromatic number of G and $\Delta^{*}(G)$ the maximum face size of G. Hornák and Jendrol' [ J. Graph Theory, 30 (1999), pp. 177--189] and Borodin and Woodall [ SIAM J. Discrete Math., submitted] independently proved this conjecture when $\Delta^{*}(G)$ is large enough. Moreover, Borodin and Woodall proved a stronger statement that $\chi_{c}(G) \leq \Delta^{*}(G) + 1$ holds if $\Delta^{*}(G) \geq 122$. In this paper, we prove that $\chi_{c}(G) \leq \Delta^{*}(G) + 1$ holds if $\Delta^{*}(G)\geq 60$.
Hikoe Enomoto, Mirko Hornák, Stanislav Jendrol'
SIAM J. Discret. Math.2