I agree that this site is using cookies. You can find further informations here.
X
Kostochka, Alexandr V.
237  results:
Search for persons X
?
1

Sharp lower bounds for the number of maximum matchings in b..:

Kostochka, Alexandr V. ; West, Douglas B. ; Xiang, Zimu
Journal of Graph Theory.  106 (2024)  3 - p. 525-555 , 2024
Link: https://doi.org/10.1002/..
 
?
2

A sharp lower bound for the spectral radius in K4-saturated..:

Kim, Jaehoon ; Kostochka, Alexandr V. ; O, Suil..
Discrete Mathematics.  346 (2023)  2 - p. 113231 , 2023
Link: https://doi.org/10.1016/..
 
?
3

Generalized DP-colorings of graphs:

Kostochka, Alexandr V. ; Schweser, Thomas ; Stiebitz, Michael
Discrete Mathematics.  346 (2023)  11 - p. 113186 , 2023
Link: https://doi.org/10.1016/..
 
?
4

3-regular graphs are 2-reconstructible:

Kostochka, Alexandr V. ; Nahvi, Mina ; West, Douglas B..
European Journal of Combinatorics.  91 (2021)  - p. 103216 , 2021
Link: https://doi.org/10.1016/..
 
?
5

Cut-Edges and Regular Factors in Regular Graphs of Odd Degr..:

Kostochka, Alexandr V. ; Raspaud, André ; Toft, Bjarne..
Graphs and Combinatorics.  37 (2020)  1 - p. 199-207 , 2020
Link: https://doi.org/10.1007/..
 
?
6

The Minimum Number of Edges in 4-Critical Digraphs of Given..:

Kostochka, Alexandr V. ; Stiebitz, Michael
Graphs and Combinatorics.  36 (2020)  3 - p. 703-718 , 2020
Link: https://doi.org/10.1007/..
 
?
7

The minimum spectral radius of Kr+1-saturated graphs:

Kim, Jaehoon ; Kim, Seog-Jin ; Kostochka, Alexandr V..
Discrete Mathematics.  343 (2020)  11 - p. 112068 , 2020
Link: https://doi.org/10.1016/..
 
?
8

Degree Lists and Connectedness are 3-Reconstructible for Gr..:

Kostochka, Alexandr V. ; Nahvi, Mina ; West, Douglas B..
Graphs and Combinatorics.  36 (2020)  3 - p. 491-501 , 2020
Link: https://doi.org/10.1007/..
 
?
9

Largest 2-Regular Subgraphs in 3-Regular Graphs:

Choi, Ilkyoo ; Kim, Ringi ; Kostochka, Alexandr V...
Graphs and Combinatorics.  35 (2019)  4 - p. 805-813 , 2019
Link: https://doi.org/10.1007/..
 
?
10

Strong edge-colorings of sparse graphs with large maximum d..:

Choi, Ilkyoo ; Kim, Jaehoon ; Kostochka, Alexandr V..
European Journal of Combinatorics.  67 (2018)  - p. 21-39 , 2018
Link: https://doi.org/10.1016/..
 
?
11

Decomposition of sparse graphs into forests: The Nine Drago..:

Chen, Min ; Kim, Seog-Jin ; Kostochka, Alexandr V...
Journal of Combinatorial Theory, Series B.  122 (2017)  - p. 741-756 , 2017
Link: https://doi.org/10.1016/..
 
?
12

The (2k-1)-connected multigraphs with at most k-1 disjoint ..:

Kierstead, Henry A. ; Kostochka, Alexandr V. ; Yeager, Elyse C.
Combinatorica.  37 (2015)  1 - p. 77-86 , 2015
Link: https://doi.org/10.1007/..
 
?
13

Short proofs of coloring theorems on planar graphs:

Borodin, Oleg V. ; Kostochka, Alexandr V. ; Lidický, Bernard.
European Journal of Combinatorics.  36 (2014)  - p. 314-321 , 2014
Link: https://doi.org/10.1016/..
 
?
14

Planar 4-critical graphs with four triangles:

Borodin, Oleg V. ; Dvořák, Zdeněk ; Kostochka, Alexandr V...
European Journal of Combinatorics.  41 (2014)  - p. 138-151 , 2014
Link: https://doi.org/10.1016/..
 
?
15

On almost (k−1)-degenerate (k+1)-chromatic graphs and hyper..:

Kostochka, Alexandr V.
Discrete Mathematics.  313 (2013)  4 - p. 366-374 , 2013
Link: https://doi.org/10.1016/..
 
1-15