Mihály Hujter

According to our database, Mihály Hujter authored at least 10 papers between 1992 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2021

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

2015

Minimum order of graphs with given coloring parameters.

Gábor Bacsó, Piotr Borowiecki, Mihály Hujter, Zsolt Tuza

Discret. Math., 2015

2010

Some good characterization results relating to the Kőnig-Egerváry theorem.

Mihály Hujter

Central Eur. J. Oper. Res., 2010

2000

Sharpness of Some Intersection Theorems.

Mihály Hujter, László Spissich, Zsolt Tuza

Eur. J. Comb., 2000

1999

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

1996

Precoloring Extension 3: Classes of Perfect Graphs.

Mihály Hujter, Zsolt Tuza

Comb. Probab. Comput., 1996

1993

The Number of Maximal Independent Sets in Triangle-Free Graphs.

Mihály Hujter, Zsolt Tuza

SIAM J. Discret. Math., 1993

An upper bound on the number of cliques in a graph.

Martin Farber, Mihály Hujter, Zsolt Tuza

Networks, 1993

Graphs with no induced C₄ and 2K₂.

Zoltán Blázsik, Mihály Hujter, András Pluhár, Zsolt Tuza

Discret. Math., 1993

1992

Precoloring extension. I. Interval graphs.

Miklós Biró, Mihály Hujter, Zsolt Tuza

Discret. Math., 1992