Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Fuhong Ma"'
Publikováno v:
Discrete Applied Mathematics
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a1819064187755327c90bfafe0662fb5
https://doi.org/10.1016/j.dam.2021.09.021
https://doi.org/10.1016/j.dam.2021.09.021
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:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ba7e76e2da98b667e9598821cbb49645
https://ora.ox.ac.uk/objects/uuid:1bd7ed6f-f54d-49dc-b091-33cc390d9376
https://ora.ox.ac.uk/objects/uuid:1bd7ed6f-f54d-49dc-b091-33cc390d9376
Autor:
Changli Luo, Wuyuan Li, Bo Yang, Youwu Su, Yang Li, Zongqiang Li, Wang Mao, Xuebo Liu, Weiwei Yan, Fuhong Ma
Publikováno v:
Applied radiation and isotopes : including data, instrumentation and methods for use in agriculture, industry and medicine. 188
Carbon ions have become the most widely used particles in heavy-ion tumor therapy due to favorable physical and biological characteristics. The beam delivery system (BDS) and tumor tissues are directly bombarded with accelerated carbon ions, resultin
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9f4016847670ea5fd48cee4449e9a6c2
https://pubmed.ncbi.nlm.nih.gov/35816888
https://pubmed.ncbi.nlm.nih.gov/35816888
Publikováno v:
Applied Mathematics and Computation. 347:162-168
Let k ≥ 1 and q ≥ 3 be integers and let f ( q ) = ( 6 q 2 − 16 q + 10 ) / ( 3 q 2 − 3 q − 4 ) . In this paper, we prove that if q ≥ 4, then every tournament T with both minimum out-degree and in-degree at least ( q − 1 ) k − 1 contain
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::799435ddd6ca3c68fc52d70ce570e8b2
https://doi.org/10.1016/j.amc.2018.10.086
https://doi.org/10.1016/j.amc.2018.10.086
Publikováno v:
Discussiones Mathematicae: Graph Theory. 2018, Vol. 38 Issue 2, p491-498. 8p.
Publikováno v:
The Electronic Journal of Combinatorics. 27
In 2010, Lichiardopol conjectured for $q \geqslant 3$ and $k \geqslant 1$ that any tournament with minimum out-degree at least $(q-1)k-1$ contains $k$ disjoint cycles of length $q$. Previously the conjecture was known to hold for $q\leqslant 4$. We p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::bc8c893be0b4580e9b4836e11921d026
https://doi.org/10.37236/7715
https://doi.org/10.37236/7715
Publikováno v:
European Journal of Combinatorics. 93:103267
DP-coloring (also known as correspondence coloring) is a generalization of list coloring developed recently by Dvořak and Postle. We introduce and study ( i , j ) -defective DP-colorings of multigraphs. We concentrate on sparse multigraphs and consi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f9d2bdfbe6da6f402ccbd1845b260b68
https://doi.org/10.1016/j.ejc.2020.103267
https://doi.org/10.1016/j.ejc.2020.103267
Let t and k be two integers with t ≥ 5 and k ≥ 2 . For a graph G and a vertex x of G , we use d G ( x ) to denote the degree of x in G . Define σ t ( G ) to be the minimum value of ∑ x ∈ X d G ( x ) , where X is an independent set of G with
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bf194f1092ef456f9f5caf2d2ad3cc75