5 citations · 7 across the 6 of their papers we have counts for
6 papers
Cubes and Boxes have Rupert's passages in every direction
András Bezdek, Zhenyue Guan, Mihály Hujter +1
It is a year old counterintuitive observation of Prince Rupert of Rhine that in cube a straight tunnel can be cut, through which a second congruent cube can be passed. Hundre…
Precoloring Extension. IV. General Bounds and List Colorings
Mihály Hujter, Zsolt Tuza
A guaranteed upper bound is proved for the time complexity of the list-coloring problem on graphs.
Symmetries related to domino tilings on a chessboard
M. Hujter, A. Kaszanyitzky
In this paper we study different kinds of symmetries related to the domino tilings of chessboards.
Hamiltonian paths on directed grids
Mihály Hujter, András Kaszanyitzky
Our studies are related to a special class of FASS-curves, which can be described in a node-rewriting Lindenmayer-system. These ortho-tile (or diagonal) type recursive curves induc…
Minimum order of graphs with given coloring parameters
Gabor Bacso, Piotr Borowiecki, Mihaly Hujter +1
A complete -coloring of a graph is an assignment of colors to the vertices such that no two vertices of the same color are adjacent, and the uni…
On the multiple Borsuk numbers of sets
M. Hujter, Z. Lángi
The Borsuk number of a set S of diameter d >0 in Euclidean n-space is the smallest value of m such that S can be partitioned into m sets of diameters less than d. Our aim is to gen…