Alexander V. Kostochka

Alexander V. Kostochka's AcademicInfluence.com Rankings

Mathematics

#6826

World Rank

#9381

Historical Rank

Graph Theory

#86

World Rank

#94

Historical Rank

Measure Theory

#1638

World Rank

#2019

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Alexander V. Kostochka's Degrees

PhD Mathematics Moscow State University

Why Is Alexander V. Kostochka Influential?

(Suggest an Edit or Addition)

(See a Problem?)

Alexander V. Kostochka's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Lower bound of the hadwiger number of graphs by their average degree (1984) (289)
List Edge and List Total Colourings of Multigraphs (1997) (273)
On independent sets in hypergraphs (2011) (223)
The minimum Hadwiger number for graphs with a given mean degree of vertices (1982) (190)
On an upper bound of a graph's chromatic number, depending on the graph's degree and density (1977) (153)
The total chromatic number of any multigraph with maximum degree five is at most seven (1996) (133)
Acyclic and oriented chromatic numbers of graphs (1997) (124)
Covering and coloring polygon-circle graphs (1997) (105)
A Short Proof of the Hajnal–Szemerédi Theorem on Equitable Colouring (2008) (103)
On the maximum average degree and the oriented chromatic number of a graph (1999) (99)
Acyclic colouring of 1-planar graphs (2001) (96)
The total coloring of a multigraph with maximal degree 4 (1977) (95)
Acyclic Colourings of Planar Graphs with Large Girth (1999) (90)
Total colorings of planar graphs with large maximum degree (1997) (86)
Note to the paper of Grünbaum on acyclic colorings (1976) (82)
An Ore-type theorem on equitable coloring (2008) (76)
Choosability conjectures and multicircuits (2001) (70)
Turán problems and shadows I: Paths and cycles (2013) (70)
A fast algorithm for equitable coloring (2010) (70)
Acyclic list 7‐coloring of planar graphs (2002) (68)
Ore's conjecture on color-critical graphs is almost true (2012) (67)
The colour theorems of Brooks and Gallai extended (1996) (67)
A class of constructions for turán’s (3, 4)-problem (1982) (65)
Homomorphisms from sparse graphs with large girth (2004) (62)
On Sufficient Degree Conditions for a Graph to be $k$-linked (2006) (60)
A list analogue of equitable coloring (2003) (57)
On graphs with small Ramsey numbers * (2001) (56)
Dominating sets in k-majority tournaments (2006) (54)
Total Colourings of Planar Graphs with Large Girth (1998) (53)
Coloring intersection graphs of geometric figures with a given clique number (2004) (52)
Color-Critical Graphs and Hypergraphs with Few Edges: A Survey (2006) (50)
Variable degeneracy: extensions of Brooks' and Gallai's theorems (2000) (48)
On 11-improper 22-coloring of sparse graphs (2013) (47)
On Directed Triangles in Digraphs (2007) (43)
Defective 2-colorings of sparse graphs (2014) (42)
On Differences Between DP-Coloring and List Coloring (2017) (39)
Degree conditions for k‐ordered hamiltonian graphs (2003) (39)
List edge chromatic number of graphs with large girth (1992) (38)
DP-colorings of graphs with high chromatic number (2017) (36)
On the chromatic number of set systems (2001) (36)
On Ks, t-minors in graphs with given average degree (2008) (36)
Ore-type versions of Brooks' theorem (2009) (35)
Large Rainbow Matchings in Edge-Coloured Graphs (2012) (35)
Constructions of sparse uniform hypergraphs with high chromatic number (2010) (34)
Upper bounds on the chromatic number of graphs (1988) (33)
Coloring Some Finite Sets in ℝn (2013) (32)
Ore’s conjecture for k=4 and Grötzsch’s Theorem (2014) (32)
Avoiding long Berge cycles (2018) (32)
A new lower bound on the number of edges in colour-critical graphs and hypergraphs (2003) (31)
Sharp Dirac's theorem for DP‐critical graphs (2016) (31)
Small topological complete subgraphs of “dense” graphs (1988) (31)
Equitable colorings of outerplanar graphs (2002) (31)
Coloring uniform hypergraphs with few edges (2009) (31)
On the Number of Edges in Colour-Critical Graphs and Hypergraphs (2000) (30)
Excess in colour-critical graphs (1999) (30)
Decomposition of Sparse Graphs into Forests and a Graph with Bounded Degree (2013) (30)
On the Chromatic Number of Intersection Graphs of Convex Sets in the Plane (2004) (29)
Packing and Covering Triangles in K4-free Planar Graphs (2012) (29)
An upper bound on the domination number of n-vertex connected cubic graphs (2009) (29)
An extremal problem for H‐linked graphs (2005) (28)
The structure of large intersecting families (2016) (28)
Covering boxes by points (1993) (28)
Coloring uniform hypergraphs with few colors (2004) (28)
Adapted List Coloring of Graphs and Hypergraphs (2008) (28)
The independent domination number of a cubic 3-connected graph can be much larger than its domination number (1993) (28)
Properties of Descartes' Construction of Triangle-Free Graphs with High Chromatic Number (1999) (28)
Coloring Relatives of Intervals on the Plane, I: Chromatic Number Versus Girth (1998) (28)
Describing faces in plane triangulations (2014) (28)
On Equitable Coloring of d-Degenerate Graphs (2005) (27)
Packing chromatic number of cubic graphs (2018) (27)
Polynomial algorithms with the estimates $frac 34$ and $frac 56$ for the traveling salesman problem of the maximum (1985) (26)
Strong chromatic index of subcubic planar multigraphs (2015) (26)
Oriented 5-coloring of sparse plane graphs (2007) (26)
Turán problems and shadows II: Trees (2014) (26)
On universal graphs for planar oriented graphs of a given girth (1998) (26)
On a problem of G. O. H. Katona and T. Tarján (1979) (26)
Decomposing a planar graph with girth 9 into a forest and a matching (2008) (25)
On Bounds of the Bisection Width of Cubic Graphs (1992) (25)
A stability theorem on fractional covering of triangles by edges (2012) (25)
Efficient Graph Packing via Game Colouring (2009) (25)
Precoloring Extensions of Brooks' Theorem (2005) (25)
Graphs with chromatic number close to maximum degree (2012) (25)
Vertex decompositions of sparse graphs into an independent vertex set and a subgraph of maximum degree at most 1 (2011) (25)
On Minimum Degree Implying That a Graph is H-Linked (2006) (25)
Colorings and homomorphisms of degenerate and bounded degree graphs (2001) (24)
Improper coloring of sparse graphs with a given girth, I: (0, 1)-colorings of triangle-free graphs (2014) (24)
On a lower bound for the isoperimetric number of cubic graphs (1993) (24)
Hypergraph Ramsey numbers: Triangles versus cliques (2013) (23)
Describing 3-paths in normal plane maps (2013) (23)
On Ramsey numbers of uniform hypergraphs with given maximum degree (2006) (23)
Partial Steiner systems and matchings in hypergraphs (1998) (23)
Colouring Relatives of Intervals on the Plane, II (1998) (23)
On Graphs With Small Ramsey Numbers, II (2004) (23)
Stability in the Erdős-Gallai Theorems on cycles and paths (2015) (23)
Coloring, sparseness and girth (2014) (22)
On a Theorem of Erdos, Rubin, and Taylor on Choosability of Complete Bipartite Graphs (2002) (22)
Dense graphs have K3, t minors (2010) (22)
Turán Problems and Shadows III: Expansions of Graphs (2014) (21)
The Erdos-Lovász Tihany conjecture for quasi-line graphs (2009) (21)
Surveys in Combinatorics 2009: Extremal graph packing problems: Ore-type versus Dirac-type (2009) (21)
Intersection Statements for Systems of Sets (1997) (21)
Graphs with maximum degree 5 are acyclically 7-colorable (2011) (21)
Every 4‐Colorable Graph With Maximum Degree 4 Has an Equitable 4‐Coloring (2012) (20)
On equitable Delta-coloring of graphs with low average degree (2005) (20)
Packing Chromatic Number of Subdivisions of Cubic Graphs (2018) (20)
Balanced edge colorings (2004) (20)
Choosability with Separation of Complete Multipartite Graphs and Hypergraphs (2011) (20)
Some constructive bounds on Ramsey numbers (2010) (20)
On the Corrádi-Hajnal theorem and a question of Dirac (2016) (19)
When is an Almost Monochromatic K4 Guaranteed? (2008) (19)
Density Conditions for Panchromatic Colourings of Hypergraphs (2001) (19)
A Brooks-Type Result for Sparse Critical Graphs (2014) (19)
On r-uniform hypergraphs with circumference less than r (2018) (19)
On graphs with small Ramsey numbers (2001) (19)
Hypergraph list coloring and Euclidean Ramsey theory (2011) (19)
Equitable Colourings of d-degenerate Graphs (2003) (18)
Minimum degree conditions for H-linked graphs (2005) (18)
Conflict-Free Colourings of Uniform Hypergraphs With Few Edges (2012) (18)
Nordhaus–Gaddum‐type Theorems for decompositions into many parts (2005) (18)
Large minors in graphs with given independence number (2011) (18)
On kernel-perfect orientations of line graphs (1998) (18)
Equitable versus nearly equitable coloring and the Chen-Lih-Wu conjecture (2010) (18)
Extremal Graphs for a Graph Packing Theorem of Sauer and Spencer (2007) (18)
Packing d-degenerate graphs (2008) (18)
Every outerplanar graph is the union of two interval graphs (1999) (18)
The dimension of suborders of the Boolean lattice (1994) (17)
Planar 4-critical graphs with four triangles (2013) (17)
List Star Edge-Coloring of Subcubic Graphs (2018) (17)
An intersection theorem for systems of sets (1996) (17)
Partitions and Edge Colourings of Multigraphs (2008) (16)
Short proofs of coloring theorems on planar graphs (2012) (16)
On Ramsey Numbers of Sparse Graphs (2003) (16)
Induced subgraphs with distinct sizes (2009) (15)
On Ks, t-minors in graphs with given average degree, II (2012) (15)
Improper Coloring of Sparse Graphs with a Given Girth, II: Constructions (2016) (15)
On the minimum number of edges giving maximum oriented chromatic number (1997) (15)
Equitable List Coloring of Graphs with Bounded Degree (2013) (15)
Cycles in triangle-free graphs of large chromatic number (2014) (15)
Packing chromatic number of subcubic graphs (2017) (15)
CIRCULAR (5;2)-COLORING OF SPARSE GRAPHS (2008) (15)
A new bound on the domination number of connected cubic graphs (2009) (15)
On a graph packing conjecture by Bollobás, Eldridge and Catlin (2008) (15)
Ore's Conjecture for $k=4$ and Gr\" otzsch Theorem (2012) (14)
Tight paths in convex geometric hypergraphs (2017) (14)
A stability version for a theorem of Erdős on nonhamiltonian graphs (2016) (14)
On Deeply Critical Oriented Graphs (2001) (14)
On nice graphs (2001) (14)
Ore-type graph packing problems (2006) (14)
Stability in the Erdős-Gallai Theorem on cycles and paths, II (2018) (14)
Degree, density and chromatic number of graphs (1980) (14)
On Perfect Packings in Dense Graphs (2011) (14)
Decomposition of cartesian products of regular graphs into isomorphic trees (2013) (13)
Sizes of Induced Subgraphs of Ramsey Graphs (2009) (13)
Graphs without short odd cycles are nearly bipartite (1997) (13)
Ohba's conjecture for graphs with independence number five (2011) (13)
Nordhaus–Gaddum-type Theorems for decompositions into many parts (2005) (13)
Avoiding long Berge cycles II, exact bounds for all $n$ (2018) (12)
Degree conditions for k-ordered hamiltonian graphs (2003) (12)
A refinement of a result of Corrádi and Hajnal (2015) (12)
On Random Cubical Graphs (1992) (12)
A Characterization of Seymour Graphs (1995) (12)
Extensions of a theorem of Erdős on nonhamiltonian graphs (2017) (12)
A list version of Dirac's theorem on the number of edges in colour‐critical graphs (2002) (12)
Degree, girth and chromatic number (1978) (12)
Extremal Problems on Δ-Systems (2000) (11)
Spanning trees with pairwise nonadjacent endvertices (1997) (11)
Colour-critical graphs with few edges (1998) (11)
DP-colorings of hypergraphs (2018) (11)
Many cliques in $H$-free subgraphs of random graphs (2016) (10)
Graphs Containing Every 2-Factor (2012) (10)
Hadwiger Number and the Cartesian Product of Graphs (2005) (10)
Decompositions of quadrangle-free planar graphs (2009) (10)
Coloring Uniform Hypergraphs with Small Edge Degrees (2010) (10)
The Minimum Number of Edges in 4-Critical Digraphs of Given Order (2020) (10)
Sharpening an Ore-type version of the Corrádi–Hajnal theorem (2017) (10)
Injective edge-coloring of graphs with given maximum degree (2020) (9)
Large rainbow matchings in large graphs (2012) (9)
Tight Descriptions of 3‐Paths in Normal Plane Maps (2017) (9)
Colouring Relatives of Intervals on the Plane, II: Intervals and Rays in Two Directions (2002) (9)
On the number of edges in a graph with no (k+1)-connected subgraphs (2015) (9)
Decomposition of sparse graphs into forests: The Nine Dragon Tree Conjecture for k ≤ 2 (2015) (9)
The (2k-1)-connected multigraphs with at most k-1 disjoint cycles (2014) (9)
A lower bound for the product of the Hadwiger numbers of a graph and its complement (1989) (9)
M-degrees of quadrangle-free planar graphs (2009) (9)
Radius and Diameter of Random Subgraphs of the Hypercube (1993) (8)
The Number of Spanning Trees in Graphs with Given Degree Sequence (1995) (8)
Local and Mean Ramsey Numbers for Trees (2000) (8)
Ks,t Minors in (s+t) ‐ Chromatic Graphs, II (2014) (8)
On Hadwiger numbers of a graph and its complement (1984) (8)
Fractional DP‐colorings of sparse graphs (2018) (8)
Degree Lists and Connectedness are 3-Reconstructible for Graphs with At Least Seven Vertices (2019) (8)
Smaller planar triangle-free graphs that are not 3-list-colorable (2005) (8)
On Two Conjectures on Packing of Graphs (2005) (8)
A Bound of the Cardinality of Families Not Containing $\Delta $ -Systems (2013) (8)
On Ks,t minors in (s+t)‐chromatic graphs (2010) (8)
The domination number of cubic Hamiltonian graphs (2005) (8)
Strong edge-colorings of sparse graphs with large maximum degree (2016) (8)
Planar graphs decomposable into a forest and a matching (2009) (7)
Extremal problems for convex geometric hypergraphs and ordered hypergraphs (2019) (7)
On the independent domination number of graphs with given minimum degree (1998) (7)
Harmonious coloring of trees with large maximum degree (2012) (7)
Tree representations of graphs (2007) (7)
Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11 (2014) (7)
Small transversals in uniform hypergraphs (1992) (7)
An extremal problem for H -linked graphs (2005) (7)
Super-pancyclic hypergraphs and bipartite graphs (2019) (7)
Equitable colorings with constant number of colors (2003) (7)
Disjoint Kr-minors in large graphs with given average degree (2005) (7)
Acyclick-strong coloring of maps on surfaces (2000) (7)
M‐degrees of quadrangle‐free planar graphs (2009) (6)
Long monochromatic paths and cycles in 2-edge-colored multipartite graphs (2019) (6)
Colouring triangle-free intersection graphs of boxes on the plane (2000) (6)
On K s,t minors in (s+t)-chromatic graphs (2010) (6)
The pagenumber of spherical lattices is unbounded (2001) (6)
Hypergraphs Not Containing a Tight Tree with a Bounded Trunk (2017) (6)
Cubic Graphs with Small Independence Ratio (2017) (6)
Hypercube subgraphs with local detours (1999) (6)
Towards the Small Quasi-Kernel Conjecture (2020) (6)
Total choosability of multicircuits I (2002) (6)
An Ore-type analogue of the Sauer-Spencer Theorem (2007) (6)
Dense uniform hypergraphs have high list chromatic number (2012) (6)
Ore‐type degree conditions for a graph to be H‐linked (2008) (6)
Ordered and Convex Geometric Trees with Linear Extremal Function (2018) (6)
A list version of Dirac's theorem on the number of edges in colour-critical graphs (2002) (6)
On k‐detour subgraphs of hypercubes (2008) (6)
Choosability with separation of complete graphs and minimal abundant packings (2013) (6)
Total choosability of multicircuits II (2002) (6)
On-line DP-coloring of graphs (2020) (5)
On Reconstruction of Graphs From the Multiset of Subgraphs Obtained by Deleting ℓ Vertices (2020) (5)
Acyclic graphs with at least 2 ℓ + 1 vertices are ℓ -recognizable (2020) (5)
The minimum number of edges in a 4-critical graph that is bipartite plus 3 edges (2015) (5)
Maximum Hypergraphs without Regular Subgraphs (2014) (5)
On Large Systems of Sets with No Large Weak Δ-subsystems (1998) (5)
Ore’s conjecture for k=4 and Grötzsch’s Theorem (2014) (5)
Berge Cycles in Non-Uniform Hypergraphs (2020) (5)
A variation of a theorem by Pósa (2019) (5)
Ore-type degree conditions for a graph to be H-linked (2008) (5)
On Coloring of Sparse Graphs (2013) (5)
The nonexistence of certain generalized friendship graphs (1988) (5)
On set systems without weak 3-Delta-subsystems (1995) (5)
On Systems of Small Sets with No Large Δ-Subsystems (1999) (5)
Total interval number for graphs with bounded degree (1997) (5)
Monochromatic connected matchings in 2‐edge‐colored multipartite graphs (2019) (4)
A Hypergraph Version of a Graph Packing Theorem by Bollobás and Eldridge (2013) (4)
On the Length of the Chinese Postman Tour in Regular Graphs (1996) (4)
Regular Honest Graphs, Isoperimetric Numbers, and Bisection of Weighted Graphs (1999) (4)
3-regular Graphs Are 2-reconstructible (2019) (4)
Locally Hamiltonian graphs (1989) (4)
MINIMAX DEGREES OF QUASIPLANAR GRAPHS WITH NO SHORT CYCLES OTHER THAN TRIANGLES (2008) (4)
On the Induced Ramsey Number IR(P3, H) (2006) (4)
A list version of graph packing (2015) (4)
Monochromatic paths and cycles in 2-edge-coloured graphs with large minimum degree (2019) (4)
On 2-Detour Subgraphs of the Hypercube (2008) (4)
Coloring Clean and K4-Free Circle Graphs (2013) (4)
On reconstruction of n-vertex graphs from the multiset of (n – ℓ)-vertex induced subgraphs (2020) (4)
On 2-Connected Hypergraphs with No Long Cycles (2019) (4)
Ore-type conditions implying 2-factors consisting of short cycles (2009) (3)
A very short proof of Dirac's theorem on the number of edges in chromatically critical graphs (1996) (3)
Transversals in uniform hypergraphs with property (7, 2) (1999) (3)
Packing of graphs with small product of sizes (2008) (3)
Even cycles in hypergraphs (2005) (3)
A new tool for proving Vizing's Theorem (2014) (3)
A Refinement of the Frank-Sebő-Tardos Theorem and Its Applications (1996) (3)
Dirac's Theorem for hamiltonian Berge cycles in uniform hypergraphs (2021) (3)
Defective DP-colorings of sparse multigraphs (2019) (3)
The 7/5-conjecture strengthens itself (1995) (3)
On the length of the path of a Chinese postman in homogeneous graphs (1994) (3)
Hadwiger numbers and over-dominating colourings (2010) (3)
Tight paths and matchings in convex geometric hypergraphs (2017) (3)
( 5 , 2 )-Coloring of Sparse Graphs (2007) (3)
Many $T$ copies in $H$-free subgraphs of random graphs (2016) (3)
On the Hajo's number of graphs (2000) (2)
Partitioning ordered hypergraphs (2019) (2)
Sequences of dominating sets (1990) (2)
The Dimension of Neighboring Levels of the Boolean Lattice (1997) (2)
Vertex Set Partitions Preserving Conservativeness (2000) (2)
Toward \.Zak's conjecture on graph packing (2015) (2)
Extremal problems for hypergraph blowups of trees (2020) (2)
A Brooks-type bound for squares of K4-minor-free graphs (2009) (2)
Chvátal's Condition cannot hold for both a graph and its complement (2006) (2)
Thirteen Papers in Algebra (1986) (2)
Minors in Graphs with High Chromatic Number (2011) (2)
Many disjoint dense subgraphs versus large k-connected subgraphs in large graphs with given edge density (2009) (2)
An upper bound of the cardinality of antichain boundary in the n-cube (1991) (2)
Extremal problems on ordered and convex geometric hypergraphs (2018) (2)
Matchings in Random Spanning Subgraphs of Cubelike Graphs (1990) (2)
On k-detour subgraphs of hypercubes (2008) (2)
Maximum order of the boundary of a filter in an $n$-dimensional cube (1984) (2)
Packing (1, 1, 2, 4)-coloring of subcubic outerplanar graphs (2020) (2)
A note on spanning trees with pairwise nonadjacent end-vertices (1995) (2)
A splitting theorem for ordered hypergraphs (2019) (2)
On Minimum Independent Dominating Sets in Graphs (1996) (2)
On 2-defective DP-colorings of sparse graphs (2020) (2)
Minimax degrees of quasiplane graphs without 4-faces (2007) (2)
Strengthening Theorems of Dirac and Erdős on Disjoint Cycles (2017) (2)
On almost (k-1)-degenerate (k+1)-chromatic graphs and hypergraphs (2013) (2)
Conditions for a Bigraph to be Super-Cyclic (2020) (2)
A variation of a theorem by P\'osa. (2018) (2)
A criterion for the unique colorability of edges of bipartite multigraphs (1987) (1)
A problem on directed graphs (1983) (1)
The minimum spectral radius of Kr+1-saturated graphs (2020) (1)
On a property of $2$-connected graphs and Dirac's Theorem (2022) (1)
A hypergraph analog of Dirac's Theorem for long cycles in 2-connected graphs (2022) (1)
On Sizes of 1-Cross Intersecting Set Pair Systems (2021) (1)
Strengthening theorems of Dirac and Erd\H{o}s on disjoint cycles (2016) (1)
Maximum set of edges no two covered by a clique (1985) (1)
Defective DP-colorings of sparse simple graphs (2020) (1)
On degrees of vertices in paradoxical trees (2000) (1)
Minimum degree ensuring that a hypergraph is hamiltonian-connected (2022) (1)
The number of q-ary words with restrictions on the length of the maximal run (1998) (1)
Packing Chromatic Number of Subdivisions of Cubic Graphs (2019) (1)
On the number of connected subgraphs with small edge-boundary in regular graphs (1994) (1)
$K_{r+1}$-saturated graphs with small spectral radius (2020) (1)
An Algorithmic Answer to the Ore-Type Version of Dirac’s Question on Disjoint Cycles (2018) (1)
Graphs with bounded tree-width and large odd-girth are almost bipartite (2009) (1)
Extensions of a theorem of Erd\H{o}s on nonhamiltonian graphs (2017) (1)
Disjoint Chorded Cycles in Graphs with High Ore-Degree (2020) (1)
Transversals in Uniform Hypergraphs with Property (p, 2) (2002) (1)
Decomposing Graphs into Long Paths (2003) (1)
Estimating the Minimal Number of Colors in Acyclic $$k $$ -Strong Colorings of Maps on Surfaces (2002) (1)
Longest cycles in 3‐connected hypergraphs and bipartite graphs (2020) (1)
On DP-coloring of graphs and multigraphs (2017) (1)
Acyclic graphs with at least $2\ell+1$ vertices are $\ell$-recognizable (2021) (1)
Complexity of computation of some functions of graphs (1991) (1)
On a packing problem of Alon and Yuster (2016) (1)
On the Number of Edges in Hypergraphs Critical with Respect to Strong Colourings (2000) (1)
Irreducible hypergraphs for Hall-type conditions, and arc-minimal digraph expanders (2005) (1)
Packing and Covering Triangles in K4-free Planar Graphs (2011) (1)
On the number of graph edges not contained in common cliques (1985) (1)
DP-COLORINGS OF HYPERGRAPHS ANTON BERNSHTEYN Department of Mathematics, University of Illinois at Urbana–Champaign, IL, USA (2019) (1)
Directed Intersection Representations and the Information Content of Digraphs (2019) (1)
A sharp lower bound for the spectral radius in K4-saturated graphs (2023) (0)
A renement of the Corradi-Hajnal Theorem (2012) (0)
Extremal Union-Closed Set Families (2019) (0)
The Minimum Number of Edges in 4-Critical Digraphs of Given Order (2020) (0)
On the Hajj Os Number of Graphs (1997) (0)
C O ] 2 2 M ar 2 02 1 Acyclic graphs with at least 2 l + 1 vertices are l-recognizable (2021) (0)
Generalized DP-colorings of graphs (2019) (0)
Sparse sets in the complements of graphs with given girth (2001) (0)
Coloring, sparseness and girth (2016) (0)
Largest 2-Regular Subgraphs in 3-Regular Graphs (2019) (0)
A Refinement of the Triangle Version of the Corradi-Hajnal Theorem (2012) (0)
Stability in the Erd\H{o}s--Gallai Theorem on cycles and paths, II (2017) (0)
Sharp lower bounds for the number of maximum matchings in bipartite multigraphs (2022) (0)
List coloring and Euclidean Ramsey Theory (Abstract) (2011) (0)
Erratum: ``Locally Hamiltonian graphs'' (1989) (0)
Three representations of graphs (2007) (0)
Nilpotent Families of Endomorphisms of ðPðV Þ þ ; (Þ (2002) (0)
Planar 4-critical graphs with exactly 4 triangles (2013) (0)
LARGE MINORS IN GRAPHS WITH A GIVEN STABILITY NUMBER (2011) (0)
M-Degrees of Quadrangle-Free Graphs (2008) (0)
Color-critical n-vertex graphs with fewest edges (2012) (0)
Maximal capacity of the boundary of the Sperner family (1990) (0)
Induced subgraphs with distinct size or order (2007) (0)
Adding Edges to Increase the Chromatic Number of a Graph (2016) (0)
Largest matchings and connectivity components of random subgraphs of an $n$-dimensional cube (1989) (0)
On the smallest independent dominating sets in graphs (1994) (0)
The (2k-1)-connected multigraphs with at most k-1 disjoint cycles (2015) (0)
In memory of Dmitri\ui Germanovich Fon-Der-Flaass (2010) (0)
Graphs Containing Every 2-Factor (2011) (0)
Degree Lists and Connectedness are 3-Reconstructible for Graphs with At Least Seven Vertices (2020) (0)
Sharpening an Ore-type version of the Corrádi–Hajnal theorem (2016) (0)
Pebbles , Trees and Rigid Graphs (2005) (0)
A Brooks-Type Result for Sparse Critical Graphs (2018) (0)
Dedicated to the memory of Ivan Rival (2004) (0)
Complexity of computing some functions on graphs [translation of Metody Diskret. Analiz. bf (1991), no. 51, 7--16, 112; MR1177378 (94a:05189)] (1993) (0)
Nilpotent Families of Endomorphisms of (p(V)+, cup) (2002) (0)
Cut-Edges and Regular Factors in Regular Graphs of Odd Degree (2020) (0)
Cycles in triangle-free graphs of large chromatic number (2016) (0)
Sharp lower bounds for the number of matchings in bipartite multigraphs (2022) (0)
Saturation for the $3$-uniform loose $3$-cycle (2022) (0)
Largest 2-Regular Subgraphs in 3-Regular Graphs (2019) (0)
The Dimension of Interior Levels of the Boolean Lattice, II (1998) (0)
AN ALGORITHMIC ANSWER TO THE ORE-TYPE VERSION 1 OF DIRAC ’ S QUESTION ON DISJOINT CYCLES IN MULTIGRAPHS 2 (2017) (0)
Coloring , sparseness , and girth Noga Alon (2014) (0)
Trees with at least 6 ℓ + 10 vertices are ℓ -reconstrucible (2022) (0)
$3$-reconstructibility of rooted trees (2022) (0)
A sharp Dirac-Erd\H{o}s type bound for large graphs (2017) (0)
A refinement of a result of Corrádi and Hajnal (2014) (0)
On the 3-Reconstructibility of Trees and Rooted Trees (2021) (0)
A Sharp Dirac–Erdős Type Bound for Large Graphs (2017) (0)
Course Description | FALL 2013 MATH 583 PARTIALLY ORDERED SETS AND MATROIDS (2013) (0)
Lecture notes on sparse color-critical graphs (2016) (0)

This paper list is powered by the following services:

What Schools Are Affiliated With Alexander V. Kostochka?

Alexander V. Kostochka is affiliated with the following schools:

Zhejiang Normal University

Alexander V. Kostochka's Academic­Influence.com Rankings

Alexander V. Kostochka's Degrees

Why Is Alexander V. Kostochka Influential?

Alexander V. Kostochka's Published Works

Published Works

What Schools Are Affiliated With Alexander V. Kostochka?

Alexander V. Kostochka's AcademicInfluence.com Rankings