Precoloring extension. I. Interval graphs. - Miklós Biró; Mihály Hujter; Zsolt Tuza (Discret. Math., 1992)

Graphs with no induced C4 and 2K2. - Zoltán Blázsik; Mihály Hujter; András Pluhár; Zsolt Tuza (Discret. Math., 1993)

An upper bound on the number of cliques in a graph. - Martin Farber; Mihály Hujter; Zsolt Tuza (Networks, 1993)

The Number of Maximal Independent Sets in Triangle-Free Graphs. - Mihály Hujter; Zsolt Tuza (SIAM J. Discret. Math., 1993)

Precoloring Extension 3: Classes of Perfect Graphs. - Mihály Hujter; Zsolt Tuza (Comb. Probab. Comput., 1996)

A note on the complexity of the transportation problem with a permutable demand vector. - Mihály Hujter; Bettina Klinz; Gerhard J. Woeginger (Math. Methods Oper. Res., 1999)

Sharpness of Some Intersection Theorems. - Mihály Hujter; László Spissich; Zsolt Tuza (Eur. J. Comb., 2000)

Some good characterization results relating to the Kőnig-Egerváry theorem. - Mihály Hujter (Central Eur. J. Oper. Res., 2010)

Minimum order of graphs with given coloring parameters. - Gábor Bacsó; Piotr Borowiecki; Mihály Hujter; Zsolt Tuza (Discret. Math., 2015)

Cubes and Boxes Have Rupert's Passages in Every Nontrivial Direction. - András Bezdek; Zhenyue Guan; Mihály Hujter; Antal Joós (Am. Math. Mon., 2021)