#### Filter Results:

- Full text PDF available (6)

#### Publication Year

1992

2015

- This year (0)
- Last 5 years (1)
- Last 10 years (2)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Miklós Biró, Mihály Hujter, Zsolt Tuza
- Discrete Mathematics
- 1992

of the following general problem on vertex colorings of graphs. Suppose that some vertices of a graph G are assigned to some colors. Can this precoloring be extended to a proper coloring of G with at most k colors (for some given k)? This question was motivated by practical problems in scheduling and VLSI theory. Here we investigate its complexity status… (More)

We continue the study of the following general problem on vertex col-orings of graphs. Suppose that some vertices of a graph G are assigned to some colors. Can this \precoloring" be extended to a proper coloring of G with at most k colors (for some given k)? Here we investigate the complexity status of precoloring extendibility on some graph classes which… (More)

- Mihály Hujter, Zsolt Tuza
- Combinatorics, Probability & Computing
- 1996

We continue the study of the following general problem on vertex colorings of graphs. Suppose that some vertices of a graph G are assigned to some colors. Can this “precoloring” be extended to a proper coloring of G with at most k colors (for some given k)? Here we investigate the complexity status of precoloring extendibility on some classes of perfect… (More)

- Mihály Hujter, Zsolt Tuza
- SIAM J. Discrete Math.
- 1993

- Zoltán Blázsik, Mihály Hujter, András Pluhár, Zsolt Tuza
- Discrete Mathematics
- 1993

- Martin Farber, Mihály Hujter, Zsolt Tuza
- Networks
- 1993

For a natural number t , denote by N, the graph K2,\tK2, i.e. the graph obtained by deleting a perfect matching from the complete graph of order 2t. For example, NI is the edgeless graph on 2 vertices, N2 is the 4-cycle, and N3 is the octahedron graph shown in Fig. 1. The graphs N, were first studied by Neumann in 1942 (see [2, 61). We say that a graph G =… (More)

- Mihály Hujter, Bettina Klinz, Gerhard J. Woeginger
- Math. Meth. of OR
- 1999

In this note we investigate the computational complexity of the transportation problem with a permutable demand vector, TP-PD for short. In the TP-PD, the goal is to permute the elements of the given integer demand vector b
b1; . . . ; bn in order to minimize the overall transportation costs. Meusel and Burkard [6] recently proved that the TP-PD is… (More)

- Mihály Hujter, László Spissich, Zsolt Tuza
- Eur. J. Comb.
- 2000

- Mihály Hujter
- CEJOR
- 2010

We survey some combinatorial results which are all related to some former results of ours, and, at the same time, they are all related to the famous Kőnig–Egerváry theorem from 1931.

- M. HUJTER
- 1993

We continue the study of the following general problem on vertex colorings of graphs. Suppose that some vertices of a graph G are assigned to some colors. Can this “precoloring” be extended to a proper coloring of G with at most k colors (for some given k)? Here we investigate the complexity status of precoloring extendibility on some graph classes which… (More)