Mirko Horňák

From MaRDI portal
Person:186206

Available identifiers

zbMath Open hornak.mirkoDBLP46/1727WikidataQ12771769 ScholiaQ12771769MaRDI QIDQ186206

List of research outcomes





PublicationDate of PublicationType
On the achromatic number of the Cartesian product of two complete graphs2023-12-11Paper
3-facial edge-coloring of plane graphs2023-03-10Paper
The achromatic number of K_{6} □ K_{7} is 182021-07-30Paper
3-facial edge-coloring of plane graphs2021-05-31Paper
Facial unique-maximum edge and total coloring of plane graphs2021-03-25Paper
A survey on the cyclic coloring and its relaxations2020-12-08Paper
The achromatic number of the Cartesian product of $K_6$ and $K_q$2020-09-16Paper
The achromatic number of $K_6\square K_q$ equals $2q+3$ if $q\ge41$ is odd2020-09-15Paper
Facial incidence colorings of embedded multigraphs2018-12-05Paper
On the palette index of complete bipartite graphs2018-03-23Paper
A note on a directed version of the 1-2-3 conjecture2018-01-11Paper
On the maximum weight of a sparse connected graph of given order and size2016-06-09Paper
On the maximum weight of a dense connected graph of given order and size2016-04-27Paper
Rainbow Numbers for Cycles in Plane Triangulations2015-03-24Paper
On the maximum weight of a planar graph of given order and size2014-09-08Paper
On Neighbor-Distinguishing Index of Planar Graphs2014-08-07Paper
Minimum number of palettes in edge colorings2014-06-16Paper
https://portal.mardi4nfdi.de/entity/Q54030242014-03-25Paper
On maximum weight of a bipartite graph of given order and size2013-12-13Paper
Dense arbitrarily vertex decomposable graphs2013-01-03Paper
Decomposition of bipartite graphs into closed trails2011-02-02Paper
Minimal \(k\)-rankings for prism graphs2010-09-09Paper
General neighbour-distinguishing index via chromatic number2010-05-28Paper
Another step towards proving a conjecture by Plummer and Toft2010-03-29Paper
A general upper bound for the cyclic chromatic number of 3‐connected plane graphs2009-12-18Paper
On planar graphs arbitrarily decomposable into closed trails2008-04-16Paper
https://portal.mardi4nfdi.de/entity/Q54450362008-02-28Paper
General neighbour-distinguishing index of a graph2008-02-14Paper
On arbitrarily vertex decomposable trees2008-02-11Paper
On-line arbitrarily vertex decomposable trees2007-07-19Paper
On neighbour-distinguishing colourings from lists2007-05-29Paper
A lower bound for on-line ranking number of a path2007-04-26Paper
On the neighbour-distinguishing index of a graph2007-01-05Paper
https://portal.mardi4nfdi.de/entity/Q54813242006-08-09Paper
Achromatic Number of K 5 × K n for Small n2006-02-14Paper
On the achromatic index of \(K_{q^2+q}\) for a prime \(q\)2004-12-13Paper
https://portal.mardi4nfdi.de/entity/Q48223362004-10-25Paper
On the number of 3-polytopes with constant face weight2003-05-18Paper
Decomposition of Complete Bipartite Even Graphs into Closed Trails2003-04-23Paper
Separating 3-cycles in plane triangulations2002-04-16Paper
Achromatic number of \(K_5\times K_n\) for large \(n\)2002-02-17Paper
On-line ranking number for cycles and paths2001-04-09Paper
Cyclic chromatic number of 3-connected plane graphs2001-03-19Paper
On vertex types and cyclic colourings of 3-connected plane graphs2000-06-07Paper
https://portal.mardi4nfdi.de/entity/Q49400352000-03-01Paper
https://portal.mardi4nfdi.de/entity/Q42377271999-06-29Paper
Localization of jumps of the point-distinguishing chromatic index of K_{n,n}1998-11-09Paper
Asymptotic behaviour of the observability of \(Q_ n\)1998-01-26Paper
On the \(d\)-distance face chromatic number of plane graphs1998-01-19Paper
Unavoidable set of face types for planar maps1997-12-08Paper
https://portal.mardi4nfdi.de/entity/Q48867681996-12-09Paper
https://portal.mardi4nfdi.de/entity/Q48829851996-11-25Paper
https://portal.mardi4nfdi.de/entity/Q48651261996-07-14Paper
On existence of hypergraphs with prescribed edge degree profile1995-12-12Paper
On some properties of 4‐regular plane graphs1995-10-31Paper
https://portal.mardi4nfdi.de/entity/Q40271571993-02-21Paper
https://portal.mardi4nfdi.de/entity/Q38280441989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37288641986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33138841983-01-01Paper
A relationship between the finite groupSp =T2 = (ST)q = E and the (p,q)-completability of disk-decompositions1983-01-01Paper
(p, q)-completability of disk-decompositions, I1982-01-01Paper
(p, q)-completability of disk-decompositions, II1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41198181977-01-01Paper

Research outcomes over time

This page was built for person: Mirko Horňák