42 citations · 275 across the 72 of their papers we have counts for
11 papers · 1 filter
Injective edge-coloring of graphs with given maximum degree
Alexandr Kostochka, André Raspaud, Jingwei Xu
A coloring of edges of a graph is injective if for any two distinct edges and , the colors of and are distinct if they are at distance in or in a…
Conditions for a bigraph to be super-cyclic
Alexandr Kostochka, Mikhail Lavrov, Ruth Luo +1
A hypergraph is super-pancyclic if for each with , contains a Berge cycle with base vertex set . We present two…
Defective DP-colorings of sparse simple graphs
Yifan Jing, Alexandr Kostochka, Fuhong Ma +1
DP-coloring (also known as correspondence coloring) is a generalization of list coloring developed recently by Dvořák and Postle. We introduce and study -defective DP-colori…
-saturated graphs with small spectral radius
Jaehoon Kim, Seog-Jin Kim, Alexandr V. Kostochka +1
For a graph , a graph is -saturated if does not contain as a subgraph but for any , contains . In this note, we prove a sharp lowe…
Packing -coloring of subcubic outerplanar graphs
Alexandr Kostochka, Xujun Liu
For and a graph , a packing -coloring of is a partition of into sets such that…
Longest cycles in 3-connected hypergraphs and bipartite graphs
Alexandr Kostochka, Mikhail Lavrov, Ruth Luo +1
In the language of hypergraphs, our main result is a Dirac-type bound: we prove that every -connected hypergraph with has a h…