4 papers
Embedding graphs having Ore-degree at most five
Béla Csaba, Judit Nagy-György
Let and be graphs on vertices, where is sufficiently large. We prove that if has Ore-degree at most 5 and has minimum degree at least then $H\subset…
On the structure and syntactic complexity of generalized definite languages
Szabolcs Ivan, Judit Nagy-Gyorgy
We give a forbidden pattern characterization for the class of generalized definite languages, show that the corresponding problem is NL-complete and can be solved in quadratic time…
Online coloring graphs with high girth and high oddgirth
Judit Nagy-Gyorgy
We give an upper bound for the online chromatic number of graphs with high girth and for graphs with high oddgirth generalizing Kier- stead's algorithm for graphs that contain neit…
Randomized algorithm for the k-server problem on decomposable spaces
Judit Nagy-György
We study the randomized k-server problem on metric spaces consisting of widely separated subspaces. We give a method which extends existing algorithms to larger spaces with the gro…