Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Kostochka, A."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Defective 2-colorings of sparse graphs
O.V. Borodin
,
A.V. Kostochka
Journal of Combinatorial Theory Series B
104
, 2014, pp. 72-80
K_{s,t}
minors in
(s+t)
-chromatic graphs, II
A.V. Kostochka
Journal of Graph Theory
75
(4), 2014, pp. 377-386
Equitable list coloring of graphs with bounded degree
H.A. Kierstead
,
A.V. Kostochka
Journal of Graph Theory
74
(3), 2013, pp. 309-334
Every 4-colorable graph with maximum degree 4 has an equitable 4-coloring
H.A. Kierstead
,
A.V. Kostochka
Journal of Graph Theory
71
(1), 2012, pp. 31-48
On
K_{s,t}
minors in
(s+t)
-chromatic graphs
A.V. Kostochka
Journal of Graph Theory
65
(4), 2010, pp. 343-350
Ore-type versions of Brooks' theorem
H.A. Kierstead
,
A.V. Kostochka
Journal of Combinatorial Theory Series B
99
(2), 2009, pp. 298-305
An Ore-type theorem on equitable coloring
H.A. Kierstead
,
A.V. Kostochka
Journal of Combinatorial Theory Series B
98
(1), 2008, pp. 226-234
Adapted list coloring of graphs and hypergraphs
A.V. Kostochka
,
Xuding Zhu
SIAM Journal on Discrete Mathematics
22
(1), 2008, pp. 398-408
Dominating sets in
k
-majority tournaments
Noga Alon
,
Graham Brightwell
,
H.A. Kierstead
,
A.V. Kostochka
,
Peter Winkler
Journal of Combinatorial Theory Series B
96
(3), 2006, pp. 374-387
On Ramsey numbers of uniform hypergraphs with given maximum degree
A.V. Kostochka
,
V. Rödl
Journal of Combinatorial Theory Series A
113
(7), 2006, pp. 1555-1564
On equitable coloring of
d
-degenerate graphs
A.V. Kostochka
,
K. Nakprasit
,
S.V. Pemmaraju
SIAM Journal on Discrete Mathematics
19
(1), 2005, pp. 83-95
On equitable
\Delta
-coloring of graphs with low average degree
A.V. Kostochka
,
K. Nakprasit
Theoretical Computer Science
349
(1), 2005, pp. 82-91
Balanced edge colorings
P.N. Balister
,
A. Kostochka
,
Hao Li
,
R.H. Schelp
Journal of Combinatorial Theory Series B
90
(1), 2004, pp. 3-20
Homomorphisms from sparse graphs with large girth
O.V. Borodin
,
S.-J. Kim
,
A.V. Kostochka
,
D.B. West
Journal of Combinatorial Theory Series B
90
(1), 2004, pp. 147-159
On graphs with small Ramsey numbers, II
A.V. Kostochka
,
V. Rödl
Combinatorica
24
(3), 2004, pp. 389-401
A list analogue of equitable coloring
A.V. Kostochka
,
M.J. Pelsmajer
,
D.B. West
Journal of Graph Theory
44
(3), 2003, pp. 166-177
Acyclic list 7-coloring of planar graphs
O.V. Borodin
,
D.G. Fon-Der Flaass
,
A.V. Kostochka
,
A. Raspaud
,
E. Sopena
Journal of Graph Theory
40
(2), 2002, pp. 83-90
Nilpotent families of endomorphisms of
(P(V)^+, \cup
D. Fon-Der-Flaass
,
A. Kostochka
,
J. Nes̑etȓil
,
A. Raspaud
,
E. Sopena
Journal of Combinatorial Theory Series B
86
(1), 2002, pp. 100-108
On deeply critical oriented graphs
O.V. Borodin
,
D. Fon-Der-Flaass
,
A.V. Kostochka
,
A. Raspaud
,
E. Sopena
Journal of Combinatorial Theory Series B
81
(1), 2001, pp. 150-155
Acyclic colouring of 1-planar graphs
O.V. Borodin
,
A.V. Kostochka
,
A. Raspaud
,
E. Sopena
Discrete Applied Mathematics
114
(1-3), 2001, pp. 29-41
On graphs with small Ramsey numbers
A.V. Kostochka
,
V. Rödl
Journal of Graph Theory
(4), 2001, pp. 198-204
Vertex set partitions preserving conservativeness
A.A. Ageev
,
A.V. Kostochka
Journal of Combinatorial Theory Series B
80
(2), 2000, pp. 202-217
Local and mean Ramsey numbers for trees
B. Bollobás
,
A. Kostochka
,
R.H. Schelp
Journal of Combinatorial Theory Series B
79
(1), 2000, pp. 100-103
On the number of edges in colour-critical graphs and hypergraphs
A.V. Kostochka
,
M. Stiebitz
Combinatorica
20
(4), 2000, pp. 521-530
On large systems of sets with no large weak
\Delta
-subsystems
A.V. Kostochka
,
V. Rödl
Combinatorica
18
(2), 1998, pp. 235-240
Seiten 1
2
>