Zobrazeno 1 - 10
of 105
pro vyhledávání: '"Gexin Yu"'
Publikováno v:
Discussiones Mathematicae: Graph Theory. 2022, Vol. 42 Issue 1, p47-62. 16p.
Publikováno v:
Discrete Applied Mathematics. 310:65-74
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2a0fc30fd8cc6f191bdcaa597b835d0e
https://doi.org/10.1016/j.dam.2021.12.021
https://doi.org/10.1016/j.dam.2021.12.021
A strong edge-coloring of a graph $G$ is an edge-coloring in which every color class is an induced matching, and the strong chromatic index $\chi_s'(G)$ is the minimum number of colors needed in strong edge-colorings of $G$. A graph is $2$-degenerate
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eaedfb45184924f8a52df3ff9d0dba07
Publikováno v:
Discrete Applied Mathematics. 304:236-247
For a set of nonnegative integers c 1 , … , c k , a ( c 1 , c 2 , … , c k ) -coloring of a graph G is a partition of V ( G ) into V 1 , … , V k such that for every i , 1 ≤ i ≤ k , G [ V i ] has maximum degree at most c i . In this paper, we
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4da8a13c3a86a74069aa75bca5c71460
https://doi.org/10.1016/j.dam.2021.07.028
https://doi.org/10.1016/j.dam.2021.07.028
An edge (vertex) cut $X$ of $G$ is $r$-essential if $G-X$ has two components each of which has at least $r$ edges. A graph $G$ is $r$-essentially $k$-edge-connected (resp. $k$-connected) if it has no $r$-essential edge (resp. vertex) cuts of size les
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f90887018e478fb44ff07d05ce4aed3c
http://arxiv.org/abs/2208.12922
http://arxiv.org/abs/2208.12922
Publikováno v:
Discrete Mathematics. 346:113319
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::94c639b0a3431ee4d80153e2a1ebc2c5
https://doi.org/10.1016/j.disc.2023.113319
https://doi.org/10.1016/j.disc.2023.113319
Publikováno v:
SIAM Journal on Discrete Mathematics. 35:431-446
For a given graph $H$, a graph $G$ is H-linked if, for every injection $\varphi: V(H) \to V(G)$, the graph $G$ contains a subdivision of $H$ with $\varphi(v)$ corresponding to $v$ for each $v\in V(...
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a0467e7168c6027184f2f370f0ca60c1
https://doi.org/10.1137/19m130282x
https://doi.org/10.1137/19m130282x
An odd coloring of a graph $G$ is a proper coloring such that any non-isolated vertex in $G$ has a coloring appears odd times on its neighbors. The odd chromatic number, denoted by $\chi_o(G)$, is the minimum number of colors that admits an odd color
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5544109b4e797799105d305fb5f1abb4
http://arxiv.org/abs/2206.13967
http://arxiv.org/abs/2206.13967
Autor:
Runrun Liu, Gexin Yu
Publikováno v:
Discrete Applied Mathematics. 284:626-630
A graph is near-bipartite if its vertex set can be partitioned into an independent set and a set that induces a forest. It is clear that near-bipartite graphs are 3-colorable. In this note, we show that planar graphs without cycles of lengths in { 4
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f310c478adfcdc73d9f4027028ed54fb
https://doi.org/10.1016/j.dam.2020.04.017
https://doi.org/10.1016/j.dam.2020.04.017
Publikováno v:
Discrete Applied Mathematics. 283:626-630
For a sequence of non-decreasing positive integers S = ( s 1 , … , s k ) , a packing S -coloring is a partition of V ( G ) into sets V 1 , … , V k such that for each 1 ≤ i ≤ k the distance between any two distinct x , y ∈ V i is at least s
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::009b342206c6c00cf3a8c67fc56d2582
https://doi.org/10.1016/j.dam.2020.03.015
https://doi.org/10.1016/j.dam.2020.03.015