Zobrazeno 1 - 10
of 35
pro vyhledávání: '"Ma, Fuhong"'
Let $G$ be a $K_p$-free graph. We say $e$ is a $K_p$-saturating edge of $G$ if $e\notin E(G)$ and $G+e$ contains a copy of $K_p$. Denote by $f_p(n, e)$ the minimum number of $K_p$-saturating edges that an $n$-vertex $K_p$-free graph with $e$ edges ca
Externí odkaz:
http://arxiv.org/abs/2201.03983
Publikováno v:
In Applied Radiation and Isotopes April 2024 206
DP-coloring (also known as correspondence coloring) is a generalization of list coloring developed recently by Dvo\v{r}\'ak and Postle. We introduce and study $(i,j)$-defective DP-colorings of simple graphs. Let $g_{DP}(i,j,n)$ be the minimum number
Externí odkaz:
http://arxiv.org/abs/2006.10244
Autor:
Choi, Ilkyoo, Clemen, Felix Christian, Ferrara, Michael, Horn, Paul, Ma, Fuhong, Masařík, Tomáš
Publikováno v:
Discrete Applied Mathematics 306 (2022) 120-132
A graph where each vertex $v$ has a list $L(v)$ of available colors is $L$-colorable if there is a proper coloring such that the color of $v$ is in $L(v)$ for each $v$. A graph is $k$-choosable if every assignment $L$ of at least $k$ colors to each v
Externí odkaz:
http://arxiv.org/abs/2004.10917
DP-coloring (also known as correspondence coloring) is a generalization of list coloring developed recently by Dvorak and Postle. We introduce and study $(i,j)$-defective DP-colorings of multigraphs. We concentrate on sparse multigraphs and consider
Externí odkaz:
http://arxiv.org/abs/1912.03421
Publikováno v:
In Journal of Combinatorial Theory, Series B March 2023 159:42-60
Autor:
Choi, Ilkyoo, Clemen, Felix Christian, Ferrara, Michael, Horn, Paul, Ma, Fuhong, Masařík, Tomáš
Publikováno v:
In Discrete Applied Mathematics 15 January 2022 306:120-132
Publikováno v:
In Discrete Mathematics January 2022 345(1)
Autor:
Ma, Fuhong, Yan, Jin
In this paper, we prove the following conjecture proposed by Gould, Hirohata and Keller [Discrete Math. submitted]: Let $G$ be a graph of sufficiently large order. If $\sigma_t(G) \geq 2kt - t + 1$ for any two integers $k \geq 2$ and $t \geq 5$, then
Externí odkaz:
http://arxiv.org/abs/1707.02390
In 2010, N. Lichiardopol conjectured for $q \geq 3$ and $k \geq 1$ that any tournament with minimum out-degree at least $(q-1)k-1$ contains $k$ disjoint cycles of length $q$. We prove this conjecture for $q \geq 5$. Since it is already known to hold
Externí odkaz:
http://arxiv.org/abs/1707.02384