Peter Horák

From MaRDI portal
(Redirected from Peter Horák)
Person:215558

Available identifiers

zbMath Open horak.peterWikidataQ102274770 ScholiaQ102274770MaRDI QIDQ215558

List of research outcomes

PublicationDate of PublicationType
https://portal.mardi4nfdi.de/entity/Q62005492024-03-22Paper
On the Maximum Size of a Prefix Code2024-03-19Paper
Remembering Professor Štefan Znám, 9.2.1936--17.7.19932023-11-16Paper
Connected cubic graphs with the maximum number of perfect matchings2023-10-05Paper
Keller's Conjecture Revisited2022-12-02Paper
Characterization of Basic 5-Value Spectrum Functions Through Walsh-Hadamard Transform2021-02-24Paper
50 Years of the Golomb--Welch Conjecture2018-07-09Paper
A combinatorial problem related to sparse systems of equations2017-09-15Paper
Fast decoding of quasi-perfect Lee distance codes2017-06-08Paper
On a mnemonic construction of permutations2017-03-16Paper
An application of combinatorics in cryptography2016-10-14Paper
https://portal.mardi4nfdi.de/entity/Q57407802016-07-20Paper
Partitioning ℝ<sup><em>n</em></sup> into Connected Components2015-11-05Paper
Speeding up deciphering by hypergraph ordering2015-03-30Paper
On graphs with many cycles2014-08-08Paper
Tiling \(\mathbb R^5\) by crosses2014-07-04Paper
A generalization of Lee codes2014-02-25Paper
A new approach towards the Golomb-Welch conjecture2014-02-10Paper
On quasigroups with few associative triples2012-05-22Paper
Non-periodic tilings of \({\mathbb{R}}^{n}\) by crosses2012-03-02Paper
On hamiltonian cycles in the prism over the odd graphs2011-11-15Paper
https://portal.mardi4nfdi.de/entity/Q53928312011-04-14Paper
Error-correcting codes and Minkowski’s conjecture2010-10-14Paper
On complexity of round transformations2009-12-15Paper
On perfect Lee codes2009-12-15Paper
Enumerating and decoding perfect linear Lee codes2009-10-14Paper
Equitable specialized block-colourings for Steiner triple systems2009-04-29Paper
On a problem of Marco Buratti2009-04-07Paper
Tilings in Lee metric2009-03-04Paper
On covering vertices of a graph by trees2008-09-04Paper
Completing Latin squares: Critical sets II2007-01-24Paper
Fast decoding of quasi-perfect Lee distance codes2006-11-22Paper
The prism over the middle-levels graph is Hamiltonian2006-05-02Paper
On the chromatic number of Steiner triple systems of order 252005-10-10Paper
Extended Petersen graphs2005-10-10Paper
https://portal.mardi4nfdi.de/entity/Q54615202005-07-26Paper
https://portal.mardi4nfdi.de/entity/Q31562352005-01-06Paper
The Hamilton-Waterloo problem: the case of Hamilton cycles and triangle-factors2004-08-20Paper
On non-polynomial Latin squares2004-08-16Paper
https://portal.mardi4nfdi.de/entity/Q44575552004-03-25Paper
https://portal.mardi4nfdi.de/entity/Q47985272003-06-16Paper
Completing Latin squares: Critical sets2003-03-19Paper
https://portal.mardi4nfdi.de/entity/Q31472722003-03-18Paper
Some applications of graph theory to other parts of mathematics.2001-11-18Paper
https://portal.mardi4nfdi.de/entity/Q48732242001-11-13Paper
The train marshalling problem2001-06-21Paper
https://portal.mardi4nfdi.de/entity/Q45030932001-05-28Paper
A lower bound on the number of hamiltonian cycles2001-03-30Paper
https://portal.mardi4nfdi.de/entity/Q44894872000-12-28Paper
An Optimization Problem in Statistical Databases2000-07-20Paper
https://portal.mardi4nfdi.de/entity/Q42669282000-04-10Paper
https://portal.mardi4nfdi.de/entity/Q49400402000-03-01Paper
https://portal.mardi4nfdi.de/entity/Q49400762000-03-01Paper
On the strong chromatic index of cyclic multigraphs2000-01-30Paper
https://portal.mardi4nfdi.de/entity/Q42617661999-09-12Paper
https://portal.mardi4nfdi.de/entity/Q42427421999-08-10Paper
Minimal oriented graphs of diameter 21999-08-02Paper
A combinatorial problem in database security1999-03-30Paper
https://portal.mardi4nfdi.de/entity/Q43427721998-01-05Paper
Kirkman's school projects1997-10-08Paper
https://portal.mardi4nfdi.de/entity/Q43510791997-08-27Paper
https://portal.mardi4nfdi.de/entity/Q31276381997-05-28Paper
Decomposing 4-Regular Graphs into Triangle-Free 2-Factors1997-05-26Paper
https://portal.mardi4nfdi.de/entity/Q48655271996-02-25Paper
https://portal.mardi4nfdi.de/entity/Q48490601996-01-18Paper
https://portal.mardi4nfdi.de/entity/Q48384541995-07-12Paper
On a matrix partition conjecture1995-04-05Paper
Isomorphic factorizations of trees1995-03-20Paper
https://portal.mardi4nfdi.de/entity/Q43206851995-02-02Paper
Local and global average degree in graphs and multigraphs1994-11-30Paper
Euler's Theorem1994-07-10Paper
Large \(s\)-representable set systems with low maximum degree1994-05-24Paper
Induced matchings in cubic graphs1994-05-19Paper
https://portal.mardi4nfdi.de/entity/Q31379671994-01-09Paper
https://portal.mardi4nfdi.de/entity/Q31369931993-11-07Paper
https://portal.mardi4nfdi.de/entity/Q40143141992-10-06Paper
https://portal.mardi4nfdi.de/entity/Q39885201992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q39832531992-06-27Paper
Extending partial systems of distinct representatives1992-06-26Paper
https://portal.mardi4nfdi.de/entity/Q39720051992-06-25Paper
Erratum volume 50, number 2 (1990): Peter Horák, ``A coloring problem related to the Erdős-Faber-Lovász conjecture, pp. 321-3221991-01-01Paper
Solution of two problems of P. Erdős concerning Hamiltonian cycles1990-01-01Paper
A coloring problem related to the Erdős, Faber, Lovasz conjecture1990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32010751990-01-01Paper
On Alspach's conjecture1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42054471989-01-01Paper
Subgraphs intersecting any Hamiltonian cycle1988-01-01Paper
A construction of thickness-minimal graphs1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37986571987-01-01Paper
On a construction of Thomassen1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30393521983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36651331983-01-01Paper
Latin parallelepipeds and cubes1982-01-01Paper
On a Modified Concept of Thickness of a Graph1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33409011982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39505801982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39537951982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39689541982-01-01Paper
Note on a new coloring number of a graph1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41848611979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41848671979-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Peter Horák