The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Alexandr V. Kostochka: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Alexander A. Ageev, Alexandr V. Kostochka, Zoltán Szigeti
    A Characterization of Seymour Graphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 1995, pp:364-372 [Conf]
  2. Sriram V. Pemmaraju, Kittikorn Nakprasit, Alexandr V. Kostochka
    Equitable colorings with constant number of colors. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:458-459 [Conf]
  3. Alexandr V. Kostochka
    Transversals in Uniform Hypergraphs with Property (p, 2). [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2002, v:22, n:2, pp:275-285 [Journal]
  4. Alexandr V. Kostochka
    A class of constructions for Turán's (3, 4) problem. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1982, v:2, n:2, pp:187-192 [Journal]
  5. Alexandr V. Kostochka
    Lower bound of the Hadwiger number of graphs by their average degree. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1984, v:4, n:4, pp:307-316 [Journal]
  6. Alexandr V. Kostochka
    Maximum set of edges no two covered by a clique. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1985, v:5, n:3, pp:229-236 [Journal]
  7. Alexandr V. Kostochka, László Pyber
    Samll topological complete subgraphs of "dense" graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1988, v:8, n:1, pp:83-86 [Journal]
  8. Alexandr V. Kostochka, Vojtech Rödl
    On Graphs With Small Ramsey Numbers, II. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:24, n:3, pp:389-401 [Journal]
  9. Alexandr V. Kostochka, Vojtech Rödl
    On Large Systems of Sets with No Large Weak <Delta>-subsystems. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1998, v:18, n:2, pp:235-240 [Journal]
  10. Alexandr V. Kostochka, Michael Stiebitz
    On the Number of Edges in Colour-Critical Graphs and Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2000, v:20, n:4, pp:521-530 [Journal]
  11. Alexandr V. Kostochka, Douglas R. Woodall
    Density Conditions for Panchromatic Colourings of Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2001, v:21, n:4, pp:515-541 [Journal]
  12. Seog-Jin Kim, Alexandr V. Kostochka, Kittikorn Nakprasit
    On the Chromatic Number of Intersection Graphs of Convex Sets in the Plane. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal]
  13. Alexandr V. Kostochka
    On a Theorem of Erdos, Rubin, and Taylor on Choosability of Complete Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2002, v:9, n:1, pp:- [Journal]
  14. Alexandr V. Kostochka, Kittikorn Nakprasit
    Equitable Colourings Of D-Degenerate Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2003, v:12, n:1, pp:- [Journal]
  15. Alexandr V. Kostochka, Jaroslav Nesetril
    Properties Of Descartes' Construction Of Triangle-Free Graphs With High Chromatic Number. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1999, v:8, n:5, pp:- [Journal]
  16. Alexandr V. Kostochka, Benny Sudakov
    On Ramsey Numbers of Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2003, v:12, n:5-6, pp:627-641 [Journal]
  17. Oleg V. Borodin, Alexandr V. Kostochka, André Raspaud, Eric Sopena
    Acyclic colouring of 1-planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:114, n:1-3, pp:29-41 [Journal]
  18. Oleg V. Borodin, Alexandr V. Kostochka, Bjarne Toft
    Variable degeneracy: extensions of Brooks' and Gallai's theorems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:214, n:1-3, pp:101-112 [Journal]
  19. Walter A. Deuber, Alexandr V. Kostochka
    On degrees of vertices in paradoxical trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:212, n:1-2, pp:53-59 [Journal]
  20. Alexei N. Glebov, Alexandr V. Kostochka, Vladimir A. Tashkinov
    Smaller planar triangle-free graphs that are not 3-list-colorable. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:290, n:2/3, pp:269-274 [Journal]
  21. Gregory Gutin, Alexandr V. Kostochka, Bjarne Toft
    On the Hajo's number of graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:213, n:1-3, pp:153-161 [Journal]
  22. Pavol Hell, Alexandr V. Kostochka, André Raspaud, Eric Sopena
    On nice graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:234, n:1-3, pp:39-51 [Journal]
  23. Alexandr V. Kostochka
    Equitable colorings of outerplanar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:258, n:1-3, pp:373-377 [Journal]
  24. Alexandr V. Kostochka, Jaroslav Nesetril, P. Smolíková
    Colorings and homomorphisms of degenerate and bounded degree graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:257-276 [Journal]
  25. Alexandr V. Kostochka, Irina G. Perepelitsa
    Colouring triangle-free intersection graphs of boxes on the plane. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:220, n:1-3, pp:243-249 [Journal]
  26. Alexandr V. Kostochka, B. Y. Stodolsky
    On domination in connected cubic graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2005, v:304, n:1-3, pp:45-50 [Journal]
  27. Alexandr V. Kostochka, Douglas R. Woodall
    Choosability conjectures and multicircuits. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:240, n:1-3, pp:123-143 [Journal]
  28. Alexandr V. Kostochka, Douglas R. Woodall
    Sparse sets in the complements of graphs with given girth. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:163-174 [Journal]
  29. Noga Alon, Peter Hamburger, Alexandr V. Kostochka
    Regular Honest Graphs, Isoperimetric Numbers, and Bisection of Weighted Graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1999, v:20, n:6, pp:469-481 [Journal]
  30. Thomas Böhme, Alexandr V. Kostochka
    Disjoint Kr-minors in large graphs with given average degree. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:3-4, pp:289-292 [Journal]
  31. Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall
    Total Colourings of Planar Graphs with Large Girth. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1998, v:19, n:1, pp:19-24 [Journal]
  32. Alexandr V. Kostochka, Jaroslav Nesetril
    Colouring Relatives of Intervals on the Plane, II: Intervals and Rays in Two Directions. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2002, v:23, n:1, pp:37-41 [Journal]
  33. Alexandr V. Kostochka, Jaroslav Nesetril
    Coloring Relatives of Intervals on the Plane, I: Chromatic Number Versus Girth. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1998, v:19, n:1, pp:103-110 [Journal]
  34. Alexandr V. Kostochka, Douglas R. Woodall
    On the Number of Edges in Hypergraphs Critical with Respect to Strong Colourings. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2000, v:21, n:2, pp:249-255 [Journal]
  35. Alexandr V. Kostochka, Douglas R. Woodall
    Irreducible hypergraphs for Hall-type conditions, and arc-minimal digraph expanders. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2005, v:26, n:7, pp:1119-1138 [Journal]
  36. Nancy Eaton, Zoltán Füredi, Alexandr V. Kostochka, Jozef Skokan
    Tree representations of graphs. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2007, v:28, n:4, pp:1087-1098 [Journal]
  37. Alexander A. Ageev, Alexandr V. Kostochka
    Vertex Set Partitions Preserving Conservativeness. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2000, v:80, n:2, pp:202-217 [Journal]
  38. Paul N. Balister, Alexandr V. Kostochka, Hao Li, Richard H. Schelp
    Balanced edge colorings. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:90, n:1, pp:3-20 [Journal]
  39. Béla Bollobás, Alexandr V. Kostochka, Richard H. Schelp
    Local and Mean Ramsey Numbers for Trees. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2000, v:79, n:1, pp:100-103 [Journal]
  40. Oleg V. Borodin, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, André Raspaud, Eric Sopena
    On Deeply Critical Oriented Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2001, v:81, n:1, pp:150-155 [Journal]
  41. Oleg V. Borodin, Seog-Jin Kim, Alexandr V. Kostochka, Douglas B. West
    Homomorphisms from sparse graphs with large girth. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:90, n:1, pp:147-159 [Journal]
  42. Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall
    List Edge and List Total Colourings of Multigraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1997, v:71, n:2, pp:184-204 [Journal]
  43. Walter A. Deuber, Paul Erdös, David S. Gunderson, Alexandr V. Kostochka, A. G. Meyer
    Intersection Statements for Systems of Sets. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1997, v:79, n:1, pp:118-132 [Journal]
  44. Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Eric Sopena
    Nilpotent Families of Endomorphisms of (p(V)+, cup). [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2002, v:86, n:1, pp:100-108 [Journal]
  45. Alexandr V. Kostochka, Michael Stiebitz
    A new lower bound on the number of edges in colour-critical graphs and hypergraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:87, n:2, pp:374-402 [Journal]
  46. Alexandr V. Kostochka, Jacques Verstraëte
    Even cycles in hypergraphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2005, v:94, n:1, pp:173-182 [Journal]
  47. Alexandr V. Kostochka, Vojtech Rödl
    On Ramsey numbers of uniform hypergraphs with given maximum degree. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2006, v:113, n:7, pp:1555-1564 [Journal]
  48. Noga Alon, Graham Brightwell, Hal A. Kierstead, Alexandr V. Kostochka, Peter Winkler
    Dominating sets in k-majority tournaments. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2006, v:96, n:3, pp:374-387 [Journal]
  49. Oleg V. Borodin, Alexandr V. Kostochka
    On an upper bound of a graph's chromatic number, depending on the graph's degree and density. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1977, v:23, n:2-3, pp:247-250 [Journal]
  50. Alexandr V. Kostochka, Vladimir A. Tashkinov
    Decomposing Graphs into Long Paths. [Citation Graph (0, 0)][DBLP]
    Order, 2003, v:20, n:3, pp:239-253 [Journal]
  51. Alexandr V. Kostochka
    Coloring uniform hypergraphs with few colors. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2004, v:24, n:1, pp:1-10 [Journal]
  52. Alexandr V. Kostochka
    Matchings in Random Spanning Subgraphs of Cubelike Graphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1990, v:1, n:3, pp:277-286 [Journal]
  53. Alexandr V. Kostochka
    The Number of Spanning Trees in Graphs with Given Degree Sequence. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1995, v:6, n:2/3, pp:269-274 [Journal]
  54. Alexandr V. Kostochka
    An intersection theorem for systems of sets. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1996, v:9, n:1-2, pp:213-221 [Journal]
  55. Alexandr V. Kostochka, Dhruv Mubayi, Vojtech Rödl, Prasad Tetali
    On the chromatic number of set systems. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2001, v:19, n:2, pp:87-98 [Journal]
  56. Alexandr V. Kostochka, Vojtech Rödl
    Partial Steiner systems and matchings in hypergraphs. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1998, v:13, n:3-4, pp:335-347 [Journal]
  57. Alexandr V. Kostochka, Alexander A. Sapozhenko, K. Weber
    Radius and Diameter of Random Subgraphs of the Hypercube. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1993, v:4, n:2, pp:215-230 [Journal]
  58. Michael O. Albertson, Alexandr V. Kostochka, Douglas B. West
    Precoloring Extensions of Brooks' Theorem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2004, v:18, n:3, pp:542-553 [Journal]
  59. Alexandr V. Kostochka, Kittikorn Nakprasit, Sriram V. Pemmaraju
    On Equitable Coloring of d-Degenerate Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2005, v:19, n:1, pp:83-95 [Journal]
  60. Alexandr V. Kostochka, Kittikorn Nakprasit
    On equitable Delta-coloring of graphs with low average degree. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:349, n:1, pp:82-91 [Journal]
  61. Alexandr V. Kostochka, Gexin Yu
    An extremal problem for H-linked graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:50, n:4, pp:321-339 [Journal]
  62. Zoltán Füredi, Alexandr V. Kostochka, Riste Skrekovski, Michael Stiebitz, Douglas B. West
    Nordhaus-Gaddum-type Theorems for decompositions into many parts. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:50, n:4, pp:273-292 [Journal]
  63. Oleg V. Borodin, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Eric Sopena
    On the maximum average degree and the oriented chromatic number of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:206, n:1-3, pp:77-89 [Journal]
  64. Dmitry Fon-Der-Flaass, Alexandr V. Kostochka, Douglas R. Woodall
    Transversals in uniform hypergraphs with property (7, 2). [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:207, n:1-3, pp:277-284 [Journal]
  65. Oleg V. Borodin, Alexandr V. Kostochka, Douglas R. Woodall
    On kernel-perfect orientations of line graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:45-49 [Journal]
  66. Alexandr V. Kostochka, Michael Stiebitz
    Colour-critical graphs with few edges. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:125-137 [Journal]
  67. N. I. Glebov, Alexandr V. Kostochka
    On the independent domination number of graphs with given minimum degree. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:261-266 [Journal]
  68. Oleg V. Borodin, Alexandr V. Kostochka, Jaroslav Nesetril, André Raspaud, Eric Sopena
    On universal graphs for planar oriented graphs of a given girth. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:188, n:1-3, pp:73-85 [Journal]
  69. Alexandr V. Kostochka
    The total chromatic number of any multigraph with maximum degree five is at most seven. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:199-214 [Journal]
  70. Alexandr V. Kostochka, Michael Stiebitz, B. Wirth
    The colour theorems of Brooks and Gallai extended. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:162, n:1-3, pp:299-303 [Journal]
  71. Alexandr V. Kostochka, Jan Kratochvíl
    Covering and coloring polygon-circle graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:163, n:1-3, pp:299-305 [Journal]
  72. Ervin Györi, Alexandr V. Kostochka, Tomasz Luczak
    Graphs without short odd cycles are nearly bipartite. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:163, n:1-3, pp:279-284 [Journal]
  73. Thomas Böhme, Hajo Broersma, F. Göbel, Alexandr V. Kostochka, Michael Stiebitz
    Spanning trees with pairwise nonadjacent endvertices. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:219-222 [Journal]
  74. Alexandr V. Kostochka
    List edge chromatic number of graphs with large girth. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1992, v:101, n:1-3, pp:189-201 [Journal]
  75. Dmitry Fon-Der-Flaass, Alexandr V. Kostochka
    Covering boxes by points. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:120, n:1-3, pp:269-275 [Journal]
  76. Maria Axenovich, Dmitry Fon-Der-Flaass, Alexandr V. Kostochka
    On set systems without weak 3-Delta-subsystems. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:138, n:1-3, pp:57-62 [Journal]

  77. On a graph packing conjecture by Bollobás, Eldridge and Catlin. [Citation Graph (, )][DBLP]


  78. On Directed Triangles in Digraphs. [Citation Graph (, )][DBLP]


  79. Ore-type graph packing problems. [Citation Graph (, )][DBLP]


  80. Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer. [Citation Graph (, )][DBLP]


  81. On Sufficient Degree Conditions for a Graph to be k-linked. [Citation Graph (, )][DBLP]


  82. When is an Almost Monochromatic K4 Guaranteed? [Citation Graph (, )][DBLP]


  83. A Short Proof of the Hajnal-Szemerédi Theorem on Equitable Colouring. [Citation Graph (, )][DBLP]


  84. Efficient Graph Packing via Game Colouring. [Citation Graph (, )][DBLP]


  85. Sizes of Induced Subgraphs of Ramsey Graphs. [Citation Graph (, )][DBLP]


  86. Minimum degree conditions for H-linked graphs. [Citation Graph (, )][DBLP]


  87. On Ks, t-minors in graphs with given average degree. [Citation Graph (, )][DBLP]


  88. Planar graphs decomposable into a forest and a matching. [Citation Graph (, )][DBLP]


  89. The Erdos-Lovász Tihany conjecture for quasi-line graphs. [Citation Graph (, )][DBLP]


  90. An upper bound on the domination number of n-vertex connected cubic graphs. [Citation Graph (, )][DBLP]


  91. Many disjoint dense subgraphs versus large k-connected subgraphs in large graphs with given edge density. [Citation Graph (, )][DBLP]


  92. A Brooks-type bound for squares of K4-minor-free graphs. [Citation Graph (, )][DBLP]


  93. Ore-type conditions implying 2-factors consisting of short cycles. [Citation Graph (, )][DBLP]


  94. Dense graphs have K3, t minors. [Citation Graph (, )][DBLP]


  95. Hadwiger numbers and over-dominating colourings. [Citation Graph (, )][DBLP]


  96. Decomposing a planar graph with girth 9 into a forest and a matching. [Citation Graph (, )][DBLP]


Search in 0.102secs, Finished in 0.109secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002