|
Search the dblp DataBase
Mirko Hornák:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Mirko Hornák
Achromatic index of K12. [Citation Graph (0, 0)][DBLP] Ars Comb., 1997, v:45, n:, pp:- [Journal]
- Mirko Hornák, Roman Sotak
The fifth jump of the point-distinguishing chromatic index of Kn, n. [Citation Graph (0, 0)][DBLP] Ars Comb., 1996, v:42, n:, pp:- [Journal]
- Jochen Harant, Mirko Horák, Zdzislaw Skupien
Separating 3-cycles in plane triangulations. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2001, v:239, n:1-3, pp:127-136 [Journal]
- Mirko Hornák, Stanislav Jendrol
On vertex types and cyclic colourings of 3-connected plane graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2000, v:212, n:1-2, pp:101-109 [Journal]
- Mirko Hornák, Stanislav Jendrol
Preface. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:251, n:1-3, pp:1-0 [Journal]
- Mirko Hornák, Stanislav Jendrol
Preface. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:286, n:1-2, pp:1-0 [Journal]
- Mirko Hornák, Stefan Pcola
Achromatic number of K5?Kn for large n. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2001, v:234, n:1-3, pp:159-169 [Journal]
- Mirko Hornák, Stanislav Jendrol
Preface. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2007, v:307, n:7-8, pp:787- [Journal]
- Erik Bruoth, Mirko Hornák
A lower bound for on-line ranking number of a path. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2007, v:307, n:11-12, pp:1347-1355 [Journal]
- Keith Edwards, Mirko Hornák, Mariusz Wozniak
On the Neighbour-Distinguishing Index of a Graph. [Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2006, v:22, n:3, pp:341-350 [Journal]
- Mirko Hornák, Stefan Pcola, Mariusz Wozniak
On the Achromatic Index of for a Prime q. [Citation Graph (0, 0)][DBLP] Graphs and Combinatorics, 2004, v:20, n:2, pp:191-203 [Journal]
- Hikoe Enomoto, Mirko Hornák, Stanislav Jendrol
Cyclic Chromatic Number of 3-Connected Plane Graphs. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2001, v:14, n:1, pp:121-137 [Journal]
- Mirko Hornák, Zsolt Tuza, Mariusz Wozniak
On-line arbitrarily vertex decomposable trees. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2007, v:155, n:11, pp:1420-1429 [Journal]
- Mirko Hornák, Roman Sotak
Asymptotic behaviour of the observability of Qn. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:176, n:1-3, pp:139-148 [Journal]
- Mirko Hornák, Stanislav Jendrol
On the d-distance face chromatic number of plane graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:164, n:1-3, pp:171-174 [Journal]
- Mirko Hornák, Rudolf Lauff, Roman Sotak
On existence of hypergraphs with prescribed edge degree profile. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1995, v:146, n:1-3, pp:109-121 [Journal]
- Peter Bugata, Mirko Hornák, Attila Nagy
On (1, 2)-realizable graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1996, v:158, n:1-3, pp:37-47 [Journal]
On The Point-Distinguishing Chromatic Index Of Complete Bipartite Graphs. [Citation Graph (, )][DBLP]
On arbitrarily vertex decomposable trees. [Citation Graph (, )][DBLP]
General neighbour-distinguishing index of a graph. [Citation Graph (, )][DBLP]
Preface. [Citation Graph (, )][DBLP]
Another step towards proving a conjecture by Plummer and Toft. [Citation Graph (, )][DBLP]
General neighbour-distinguishing index via chromatic number. [Citation Graph (, )][DBLP]
Preface. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
|