- A list analogue of equitable coloring A. V. Kostochka
- On Directed Triangles in Digraphs Peter Hamburger y Penny Haxell z and Alexandr Kostochka x
- On a theorem by Erd}os, Rubin, and Taylor Alexandr Kostochka
- On Ramsey numbers of sparse graphs Alexandr Kostochka Benny Sudakov y
- Equitable colorings of k-degenerate graphs A. V. Kostochka
- Theorem 1 Let G = (V, E) be a (multi)graph with no loops, and the maximum degree of G be . Then the edges of G can be properly colored with at most 3/2 colors.
- Combinatorics, Probability and Computing (2003) 12, 627641. c 2003 Cambridge University Press DOI: 10.1017/S0963548303005728 Printed in the United Kingdom
- For a digraph G = (V, E) and v V , denote by E+ (v) the set of edges leaving v
- Equitable colorings of outerplanar graphs A. Kostochka
- Homomorphisms from sparse graphs with large girth
- Coloring uniform hypergraphs with few colors Alexandr Kostochka
- Ann. Comb. 14 (2010) 245249 DOI 10.1007/s00026-010-0058-1
- Course Outline --SPRING 2011 INTRODUCTION TO GRAPH THEORY
- Coloring uniform simple hypergraphs with few edges
- Ore-type graph coloring problems Alexandr Kostochka
- Math 412 HW7 Due Wednesday, March 9, 2011
- On graphs with small Ramsey numbers, II A. V. Kostochka
- -minors in graphs with given average degree Alexandr Kostochka
- Course Outline --FALL 2011 INTRODUCTION TO GRAPH THEORY
- Course Description --FALL 2011 PARTIALLY ORDERED SETS AND MATROIDS
- Discrete Mathematics 214 (2000) 101112 www.elsevier.com/locate/disc
- Discrete Math. Appi, Vol. 8, No. 2, pp. 109-118 (1998) (Q VSP 1998.
- Europ. J. Combinatorics (1998) 19, 103110 Coloring Relatives of Intervals on the Plane, I: Chromatic Number
- Order 14: 267268, 19971998. 1998 Kluwer Academic Publishers. Printed in the Netherlands.
- Article No. eujc.1998.0295 Available online at http://www.idealibrary.com on
- The Action of a Few Permutations on r-Tuples Is Quickly Transitive
- MATHEMATICS ELSEVIER Discrete Mathematics 191 (1998) 45-49
- Combinatorics, Probability and Computing (1999) 8, 467472. Printed in the United Kingdom c 1999 Cambridge University Press
- Discrete Mathematics 206 (1999) 7789 www.elsevier.com/locate/disc
- Discrete Mathematics 220 (2000) 243249 www.elsevier.com/locate/disc
- Journal of Combinatorial Theory, Series B 80, 202 217 (2000) Vertex Set Partitions Preserving Conservativeness
- Mathematical Notes, Vol. 67, No. 1, ~000 Acyclic k-Strong Coloring of Maps on Surfaces
- COMBINATORICA Bolyai Society Springer-Verlag
- ELSEVIER Discrete Mathematics 188 (1998) 73-85 MATHEMATICS
- Hypercube Subgraphs with Local Detours
- Journal of Combinatorial Theory, Series B 79, 100 103 (2000) Local and Mean Ramsey Numbers for Trees
- Discrete Mathematics 207 (1999) 277284 www.elsevier.com/locate/disc
- Combinatorics, Probability and Computing (1999) 8, 265268. Printed in the United Kingdom c 1999 Cambridge University Press
- Discrete Mathematics 213 (2000) 153161 www.elsevier.com/locate/disc
- Article No. eujc.1999.0330 Available online at http://www.idealibrary.com on
- COMBINATORICA Bolyai Society Springer-Verlag
- MATHEMATICS ELSEVIER Discrete Mathematics 191 (1998) 125-137
- ACYCLIC COLOURINGS OF PLANAR GRAPHS WITH LARGE GIRTH
- Europ. J. Combinatorics (1998) 19, 1924 Total Colourings of Planar Graphs with Large Girth
- Discrete Mathematics 212 (2000) 5359 www.elsevier.com/locate/disc
- c~ DISCRETEMATHEMATICS ELSEVIER Discrete Mathematics 188 (1998) 261-266
- GRAPHS CONTAINING EVERY 2-FACTOR ALEXANDR V. KOSTOCHKA
- MATHEMATICS ELSEVIER Discrete Mathematics 170 (1997) 219-222
- European Journal of Combinatorics 28 (2007) 10871098 www.elsevier.com/locate/ejc
- S e MR ISSN 1813-3304 Siberian Electronic Mathematical Reports
- Combinatorics, Probability and Computing (2005) 14, 723736. c 2005 Cambridge University Press doi:10.1017/S0963548305006887 Printed in the United Kingdom
- Extremal graph packing problems: Ore-type versus H. A. Kierstead, A. V. Kostochka, and Gexin Yu
- Induced Subgraphs With Distinct Sizes* Noga Alon,1
- Ore-Type Degree Conditions for a
- Acyclic List 7-Coloring of Planar Graphs
- PROD. TYPE: FLP PP:1-10 (col.fig.: nil) TCS5723 MODC+
- Acyclic and Oriented Chromatic Numbers
- LARGE RAINBOW MATCHINGS IN LARGE GRAPHS ALEXANDR KOSTOCHKA, FLORIAN PFENDER, AND MATTHEW YANCEY
- Combinatorics, Probability and Computing (2003) 12, 5360. c 2003 Cambridge University Press DOI: 10.1017/S0963548302005485 Printed in the United Kingdom
- ELSEVIER Discrete Mathematics 138 (1995) 57 62 MATHEMATICS
- European Journal of Combinatorics 29 (2008) 12351241 www.elsevier.com/locate/ejc
- Combinatorics, Probability and Computing (2007) 16, 167169. c 2006 Cambridge University Press doi:10.1017/S0963548306007899 First published online 20 September 2006 Printed in the United Kingdom
- Digital Object Identifier (DOI) 10.1007/s00373-008-0790-z Graphs and Combinatorics (2008) 24:265272
- Partitions and Edge Colourings of Multigraphs Alexandr V. Kostochka
- On perfect packings in dense graphs Jozsef Balogh,
- journal of combinatorial theory, Series A 79, 118 132 (1997) Intersection Statements for Systems of Sets
- http://www.elsevier.com/locate/jctb Journal of Combinatorial Theory, Series B 87 (2003) 374402
- EQUITABLE LIST COLORING OF GRAPHS WITH BOUNDED DEGREE H. A. KIERSTEAD
- On Ks,t Minors in (s+t)-Chromatic Graphs
- Harmonious Coloring of Trees with Large Maximum Degree Saieed Akbari
- EVERY 4-COLORABLE GRAPH WITH MAXIMUM DEGREE 4 HAS AN EQUITABLE 4-COLORING
- Journal of Combinatorial Theory, Series B 86, 100108 (2002) doi:10.1006/jctb.2002.2116
- Discrete Mathematics 304 (2005) 4550 www.elsevier.com/locate/disc
- Dense uniform hypergraphs have high list chromatic number and Alexandr Kostochka
- European Journal of Combinatorics 26 (2005) 289292 www.elsevier.com/locate/ejc
- Discrete Mathematics 310 (2010) 26372654 Contents lists available at ScienceDirect
- Journal of Combinatorial Theory, Series B 98 (2008) 226234 www.elsevier.com/locate/jctb
- SIAM J. DISCRETE MATH. c 2006 Society for Industrial and Applied Mathematics Vol. 20, No. 4, pp. 829840
- Math 412 HW4 Due Wednesday, February 15, 2012
- Packing and Covering Triangles in K4-free Planar Penny Haxell
- doi:10.1006/eujc.2000.0433 Available online at http://www.idealibrary.com on
- Digital Object Identifier (DOI) 10.1007/s00373-007-0732-1 Graphs and Combinatorics (2007) 23:419424
- On k-Detour Subgraphs of Nana Arizumi,1
- Constructions of Sparse Uniform Hypergraphs With High Chromatic
- Chvatal's Condition Cannot Hold for Both a Graph and Its Complement
- CONFLICT-FREE COLORINGS OF UNIFORM HYPERGRAPHS WITH FEW EDGES
- COMBINATORICA Bolyai Society Springer-Verlag
- On almost (k -1)-degenerate (k + 1)-chromatic graphs and hypergraphs
- Coloring intersection graphs of geometric figures with a given clique number
- Discrete Mathematics 311 (2011) 9961005 Contents lists available at ScienceDirect
- Discrete Mathematics 311 (2011) 22032215 Contents lists available at SciVerse ScienceDirect
- Discrete Mathematics 233 (2001) 163174 www.elsevier.com/locate/disc
- On Ks,t-minors in graphs with given average degree, II A.V. Kostochka
- The domination number of cubic Hamiltonian graphs
- Discrete Applied Mathematics 156 (2008) 15421548 www.elsevier.com/locate/dam
- Combinatorics, Probability and Computing (2011) 20, 513518. c Cambridge University Press 2011 doi:10.1017/S0963548311000174
- The 7/5=Conjecture Strengthens Itself-
- Copyright by SIAM. Unauthorized reproduction of this article is prohibited. SIAM J. DISCRETE MATH. c 2008 Society for Industrial and Applied Mathematics
- MATHEMATICAL STUDIES, X Budapest, pp. 123. Color-Critical Graphs and Hypergraphs with
- Discrete Mathematics 309 (2009) 65726584 Contents lists available at ScienceDirect
- PRECOLORING EXTENSIONS OF BROOKS' THEOREM MICHAEL O. ALBERTSON, ALEXANDR V. KOSTOCHKA, AND DOUGLAS B. WEST
- Discrete Mathematics 233 (2001) 257276 www.elsevier.com/locate/disc
- A Stability Theorem on Fractional Covering of Triangles by Edges
- Ann. Comb. 14 (2010) 245249 DOI 10.1007/s00026-010-0058-1
- Also available at http://amc.imfm.si ISSN 1855-3966 (printed edn.), ISSN 1855-3974 (electronic edn.)
- Combinatorics, Probability and Computing (2007) 16, 409416. c 2006 Cambridge University Press doi:10.1017/S0963548306007929 First published online 14 August 2006 Printed in the United Kingdom
- Hypergraph list coloring and Euclidean Ramsey Theory Alexandr Kostochka
- Total Colorings of Planar Graphs with Large
- On 1-improper 2-coloring of sparse graphs O. V. Borodin
- Maximum Hypergraphs without Regular Subgraphs Jaehoon Kim
- Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree
- Journal of Combinatorial Theory, Series B 100 (2010) 554559 Contents lists available at ScienceDirect
- Discrete Mathematics 309 (2009) 11421162 www.elsevier.com/locate/disc
- Digital Object Identifier (DOI) 10.1007/s00373-008-0795-7 Graphs and Combinatorics (2008) 24:291301
- Discrete Mathematics 310 (2010) 26622665 Contents lists available at ScienceDirect
- Discrete Mathematics 234 (2001) 3951 www.elsevier.com/locate/disc
- Course Outline --SPRING 2012 INTRODUCTION TO GRAPH THEORY
- Journal of Combinatorial Theory, Series B 96 (2006) 374387 www.elsevier.com/locate/jctb
- Combinatorics, Probability and Computing (2008) 17, 265270. c 2007 Cambridge University Press doi:10.1017/S0963548307008619 First published online 5 July 2007 Printed in the United Kingdom
- Coloring Uniform Hypergraphs with Few Colors*
- COMBINATORICA Bolyai Society Springer-Verlag
- A hypergraph version of a graph packing theorem by Bollobas and Alexandr Kostochka
- Journal of Combinatorial Theory, Series B 81, 150 155 (2001) On Deeply Critical Oriented Graphs
- Total Choosability of Multicircuits II
- Large Rainbow Matchings in Edge-Colored Graphs Alexandr Kostochka
- On the Chromatic Number of Set Systems
- European Journal of Combinatorics 26 (2005) 11191138 www.elsevier.com/locate/ejc
- Graphs with chromatic number close to maximum degree
- An Intersection Theorem for Systems A. V. Kostochka*
- Degree Conditions for k-Ordered Hamiltonian
- The Number of Spanning Trees in Graphs with a Given Degree Sequence
- COMBINATORICA Bolyai Society Springer-Verlag
- Discrete Mathematics 308 (2008) 44354445 www.elsevier.com/locate/disc
- Combinatorics, Probability and Computing (2003) 12, 627641. c 2003 Cambridge University Press DOI: 10.1017/S0963548303005728 Printed in the United Kingdom
- MATHEMATICS ELSEVIER DiscreteMathematics163 (1997)279-284
- A List Analogue of Equitable Coloring
- On a theorem of Erdos, Rubin, and Taylor on choosability of complete bipartite graphs
- Order 20: 239253, 2003. 2004 Kluwer Academic Publishers. Printed in the Netherlands.
- Discrete Mathematics 240 (2001) 123143 www.elsevier.com/locate/disc
- Siberian Mathematical Journal, Vol. 52, No. 5, pp. 796801, 2011 Original Russian Text Copyright c 2011 Borodin O. V. and Kostochka A. V.
- Journal of Combinatorial Theory, Series B 100 (2010) 439445 Contents lists available at ScienceDirect
- On Graphs with Small Ramsey Numbers
- Combinatorics, Probability and Computing (2006) 15, 685694. c 2005 Cambridge University Press doi:10.1017/S0963548305007479 Printed in the United Kingdom
- Discussiones Mathematicae Graph Theory 29 (2009) 8799
- SIAM J. DISCRETE MATH. c 2005 Society for Industrial and Applied Mathematics Vol. 19, No. 1, pp. 8395
- http://www.elsevier.com/locate/jctb Journal of Combinatorial Theory, Series B 90 (2004) 320
- http://www.elsevier.com/locate/jctb Journal of Combinatorial Theory, Series B 90 (2004) 147159
- BOLYAI SOCIETY Fete of Combinatorics, pp. 126. MATHEMATICAL STUDIES, X
- An Extremal Problem for H-Linked Graphs
- Discrete Mathematics 258 (2002) 373377 www.elsevier.com/locate/disc
- Combinatorics, Probability and Computing (2008) 17, 823830. c 2008 Cambridge University Press doi:10.1017/S0963548308009413 Printed in the United Kingdom
- A List Version of Dirac's Theorem on the Number
- Total Interval Number for Graphs with Bounded
- Journal of Combinatorial Theory, Series B 98 (2008) 14111415 www.elsevier.com/locate/jctb
- journal of combinatorial theory, Series B 71, 184 204 (1997) List Edge and List Total Colourings of Multigraphs
- M-Degrees of Quadrangle-Free
- Discrete Mathematics 309 (2009) 47624771 Contents lists available at ScienceDirect
- COLORING CLEAN AND K4-FREE CIRCLE GRAPHS ALEXANDR V. KOSTOCHKA AND KEVIN G. MILANS
- Discrete Mathematics 290 (2005) 269274 www.elsevier.com/locate/disc
- This article appeared in a journal published by Elsevier. The attached copy is furnished to the author for internal non-commercial research
- COMBINATORICA Bolyai Society Springer-Verlag
- MATHEMATICS ELSEVIER Discrete Mathematics 162 (1996) 199-214
- COMBINATORICA Bolyai Society Springer-Verlag
- Ks,t minors in (s + t)-chromatic graphs, II A.V. Kostochka
- Total Choosability of Multicircuits I
- ELSEVIER Discrete Mathematics 162 (1996) 299-303 MATHEMATICS
- NordhausGaddum-Type Theorems for
- A Characterization of Seymour Graphs
- Journal of Combinatorial Theory, Series B 94 (2005) 173182 www.elsevier.com/locate/jctb
- Journal of Combinatorial Theory, Series A 113 (2006) 15551564 www.elsevier.com/locate/jcta
- Coloring Uniform Hypergraphs With A.V. Kostochka,1,2
- Minimax degrees of quasiplanar graphs with no short cycles other than triangles
- Journal of Combinatorial Theory, Series B 99 (2009) 298305 Contents lists available at ScienceDirect
- Defective 2-colorings of sparse graphs O. V. Borodin
- Mathematical Notes, vol. 72, no. 1, 2002, pp. 3133. Translated from Matematicheskie Zametki, vol. 72, no. 1, 2002, pp. 3537.
- Discrete Mathematics 309 (2009) 9971000 www.elsevier.com/locate/disc
- Combinatorics, Probability and Computing (2009) 18, 765774. c 2009 Cambridge University Press doi:10.1017/S0963548309009973 Printed in the United Kingdom
- Math 412 HW7 Due Wednesday, March 7, 2012
- Journal of Combinatorial Theory, Series B 98 (2008) 8594 www.elsevier.com/locate/jctb
