- Home
- Best Scientists - Mathematics
- Alexandr V. Kostochka

Discipline name
D-index
D-index (Discipline H-index) only includes papers and citation values for an examined
discipline in contrast to General H-index which accounts for publications across all
disciplines.
Citations
Publications
World Ranking
National Ranking

Mathematics
D-index
38
Citations
6,939
336
World Ranking
1559
National Ranking
694

Computer Science
D-index
38
Citations
6,932
333
World Ranking
6416
National Ranking
3081

- Combinatorics
- Discrete mathematics
- Geometry

His primary scientific interests are in Combinatorics, Discrete mathematics, Graph, Conjecture and Graph power. His Combinatorics study which covers Upper and lower bounds that intersects with Hadwiger number. His work carried out in the field of Discrete mathematics brings together such families of science as Chromatic scale and Degree.

Alexandr V. Kostochka has included themes like Bipartite graph and Total coloring in his Degree study. His Graph research includes elements of Disjoint sets and Cartesian product. His Conjecture research incorporates elements of Graph colouring, Class, Path, Line graph and Simple graph.

- Lower bound of the hadwiger number of graphs by their average degree (259 citations)
- List Edge and List Total Colourings of Multigraphs (216 citations)
- The minimum Hadwiger number for graphs with a given mean degree of vertices (146 citations)

Alexandr V. Kostochka focuses on Combinatorics, Discrete mathematics, Graph, Conjecture and Upper and lower bounds. Hypergraph, List coloring, Degree, Vertex and Chromatic scale are the core of his Combinatorics study. His work in List coloring addresses issues such as Complete coloring, which are connected to fields such as Fractional coloring.

His work on Discrete mathematics deals in particular with Planar graph, Graph power, Edge coloring, Brooks' theorem and Bound graph. As a part of the same scientific family, Alexandr V. Kostochka mostly works in the field of Edge coloring, focusing on Graph coloring and, on occasion, Equitable coloring. He combines subjects such as Disjoint sets and Bounded function with his study of Graph.

- Combinatorics (102.34%)
- Discrete mathematics (60.42%)
- Graph (36.72%)

- Combinatorics (102.34%)
- Graph (36.72%)
- Hypergraph (13.80%)

Alexandr V. Kostochka mostly deals with Combinatorics, Graph, Hypergraph, Upper and lower bounds and Conjecture. Alexandr V. Kostochka frequently studies issues relating to Discrete mathematics and Combinatorics. His Discrete mathematics research is multidisciplinary, incorporating elements of Tree and Discharging method.

His biological study spans a wide range of topics, including Multiset, Chromatic scale and Partition. His Upper and lower bounds research includes themes of Degree, Cubic graph, Bounded function and Girth. His Conjecture research is multidisciplinary, relying on both Dense graph and Edge.

- On DP-coloring of graphs and multigraphs (41 citations)
- DP-colorings of graphs with high chromatic number (35 citations)
- Packing chromatic number of cubic graphs (25 citations)

- Combinatorics
- Geometry
- Discrete mathematics

His primary areas of investigation include Combinatorics, Graph, Discrete mathematics, Hypergraph and List coloring. His Combinatorics study frequently involves adjacent topics like Upper and lower bounds. His study in the field of Graph property is also linked to topics like Social connectedness.

The various areas that Alexandr V. Kostochka examines in his Discrete mathematics study include Chromatic scale and Tree. The Hypergraph study combines topics in areas such as Structure and Block. His Bipartite graph research integrates issues from Fractional coloring, Circumference, Degree and Girth.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

List Edge and List Total Colourings of Multigraphs

O.V. Borodin;A.V. Kostochka;D.R. Woodall.

Journal of Combinatorial Theory, Series B **(1997)**

332 Citations

Lower bound of the hadwiger number of graphs by their average degree

Alexandr V. Kostochka.

Combinatorica **(1984)**

306 Citations

The minimum Hadwiger number for graphs with a given mean degree of vertices

A. V. Kostochka.

Metody Diskret. Analiz. **(1982)**

193 Citations

The total chromatic number of any multigraph with maximum degree five is at most seven

A. V. Kostochka.

Discrete Mathematics **(1996)**

157 Citations

On an upper bound of a graph's chromatic number, depending on the graph's degree and density

Oleg V. Borodin;Alexandr V. Kostochka.

Journal of Combinatorial Theory, Series B **(1977)**

154 Citations

Acyclic and oriented chromatic numbers of graphs

A. V. Kostochka;E. Sopena;X. Zhu.

Journal of Graph Theory **(1997)**

146 Citations

The total coloring of a multigraph with maximal degree 4

Alexandr V. Kostochka.

Discrete Mathematics **(1977)**

136 Citations

On the maximum average degree and the oriented chromatic number of a graph

O.V. Borodin;A.V. Kostochka;J. Nešetřil;A. Raspaud.

Discrete Mathematics **(1999)**

135 Citations

Covering and coloring polygon-circle graphs

Alexandr Kostochka;Jan Kratochvíl.

Discrete Mathematics **(1997)**

129 Citations

Total colorings of planar graphs with large maximum degree

O. V. Borodin;A. V. Kostochka;D. R. Woodall.

Journal of Graph Theory **(1997)**

122 Citations

If you think any of the details on this page are incorrect, let us know.

Contact us

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

University of Illinois at Urbana-Champaign

University of Illinois at Urbana-Champaign

University of Illinois at Urbana-Champaign

Tel Aviv University

Zhejiang Normal University

Charles University

Emory University

University of Memphis

ETH Zurich

Adam Mickiewicz University in Poznań

University of Illinois at Urbana-Champaign

The University of Texas at Austin

Tohoku University

Natural History Museum

Aligarh Muslim University

Northwestern University

Aarhus University

US Forest Service

University of Innsbruck

University of California, Berkeley

Swansea University

Hebrew University of Jerusalem

Harvard University

University of Toronto

University of Gothenburg

John Hunter Hospital

Something went wrong. Please try again later.