Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Simonyi, Gábor - Alfréd Rényi Mathematical Institute of the Hungarian Academy of Sciences
Connected matchings and Hadwiger's conjecture Zoltan Furedi
SIAM J. DISCRETE MATH. c 2010 Society for Industrial and Applied Mathematics Vol. 24, No. 2, pp. 441456
ON TYPES OF GROWTH FOR GRAPHDIFFERENT PERMUTATIONS
On the minimum number of edges giving maximum oriented chromatic number
Gallai colorings and domination in multipartite digraphs Andrs Gyrfs
On topological relaxations of chromatic conjectures Gabor Simonyi1
Colourful theorems and topological lower bounds on chromatic numbers
On directed local chromatic number, shift graphs, and Borsuk-like graphs
Note on the optimal structure of recovering set pairs in lattices: the sandglass conjecture
Trifference Janos Korner
Colorful subgraphs in Kneser-like graphs Gabor Simonyi1
GRAPHDIFFERENT PERMUTATIONS Janos Korner
Necklace bisection with one cut less than needed Gabor Simonyi1
Local chromatic number and distinguishing the strength of topological obstructions
Local chromatic number of quadrangulations of surfaces Bojan Mohar
FAMILIES OF GRAPH-DIFFERENT HAMILTON PATHS
