2 citations · 2 across the 16 of their papers we have counts for
17 papers · 1 filter
DP vertex-arboricity of sparse graphs
Peter Bradshaw, Alexandr Kostochka, Zimu Xiang
The vertex arboricity of a multigraph is the minimum number for which can be partitioned into subsets, each of which induces an acyclic subgraph…
An introduction to equitable DP coloring of graphs
H. A. Kierstead, Alexandr Kostochka, Zimu Xiang
A proper -coloring of vertices of an -vertex graph is equitable if the size of every color class is or . An extension of it to list col…
Caterpillars with vertices are reconstructible from subgraphs with at most vertices
Alexandr V. Kostochka, Zishen Qu, Maddy Ritter +1
The $\textit{$m$-deck}$ of an -vertex graph is the multiset of unlabeled induced subgraphs with vertices. Caterpillars are trees in which all nonleaf vertices lie on a singl…
Turán number of four vertex-disjoint cliques
Alexandr Kostochka, Dadong Peng, Liang Zhang
Given a graph , the Turán number of is the maximum number of edges of an -vertex simple graph containing no as a subgraph. Let denote the disjo…
Flexible DP 3-coloring of sparse multigraphs
Peter Bradshaw, Ilkyoo Choi, Alexandr Kostochka
A \emph{request} on a graph assigns a preferred color to a subset of the vertices. A graph is \emph{-flexibly -choosable} if for every -list assignment and every r…
Partition of Sparse Multigraphs into a Forest and a Forest with Restrictions
Ilkyoo Choi, Alexandr V. Kostochka, Matthew Yancey
The following measure of sparsity of multigraphs refining the maximum average degree: For and an arbitrary real , a multigraph is \emph{-sparse} if it is loople…