#### Filter Results:

- Full text PDF available (6)

#### Publication Year

1992

2015

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

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

This paper is the …rst article in a series devoted to 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)? This question was motivated by practical problems in… (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
- SIAM J. Discrete Math.
- 1993

- 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)

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

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

- M. HUJTER
- 1993

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, Bettina Klinz, Gerhard J. Woeginger
- Math. Meth. of OR
- 1999

- Gábor Bacsó, Piotr Borowiecki, Mihály Hujter, Zsolt Tuza
- Discrete Mathematics
- 2015

A complete k-coloring of a graph G = (V, E) is an assignment ϕ : V → {1,. .. , k} of colors to the vertices such that no two vertices of the same color are adjacent, and the union of any two color classes contains at least one edge. Three extensively investigated graph invariants related to complete colorings are the minimum and maximum number of colors in… (More)

- 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˝ onig–Egerváry theorem from 1931.