Mihály Hujter

11 papers Journal 11
YearRankTypeTitle / Venue / Authors
2021 J jnl
Cubes and Boxes Have Rupert's Passages in Every Nontrivial Direction.
Am. Math. Mon.
András Bezdek, Zhenyue Guan, Mihály Hujter, Antal Joós
2015 J jnl
Minimum order of graphs with given coloring parameters.
Discret. Math.
Gábor Bacsó, Piotr Borowiecki, Mihály Hujter, Zsolt Tuza
2013 J jnl
Minimum order of graphs with given coloring parameters.
CoRR
Gábor Bacsó, Piotr Borowiecki, Mihály Hujter, Zsolt Tuza
2010 J jnl
Some good characterization results relating to the Kőnig-Egerváry theorem.
Central Eur. J. Oper. Res.
Mihály Hujter
2000 J jnl
Sharpness of Some Intersection Theorems.
Eur. J. Comb.
Mihály Hujter, László Spissich, Zsolt Tuza
1999 J jnl
A note on the complexity of the transportation problem with a permutable demand vector.
Math. Methods Oper. Res.
Mihály Hujter, Bettina Klinz, Gerhard J. Woeginger
1996 J jnl
Precoloring Extension 3: Classes of Perfect Graphs.
Comb. Probab. Comput.
Mihály Hujter, Zsolt Tuza
1993 J jnl
An upper bound on the number of cliques in a graph.
Networks
Martin Farber, Mihály Hujter, Zsolt Tuza
1993 J jnl
Graphs with no induced C
Discret. Math.
Zoltán Blázsik, Mihály Hujter, András Pluhár, Zsolt Tuza
1993 J jnl
The Number of Maximal Independent Sets in Triangle-Free Graphs.
SIAM J. Discret. Math.
Mihály Hujter, Zsolt Tuza
1992 J jnl
Precoloring extension. I. Interval graphs.
Discret. Math.
Miklós Biró, Mihály Hujter, Zsolt Tuza