Zobrazeno 1 - 10
of 16
pro vyhledávání: '"Guangming Jing"'
Publikováno v:
SIAM Journal on Discrete Mathematics. 36:2258-2270
Given a simple graph $G$, denote by $\Delta(G)$, $\delta(G)$, and $\chi'(G)$ the maximum degree, the minimum degree, and the chromatic index of $G$, respectively. We say $G$ is \emph{$\Delta$-critical} if $\chi'(G)=\Delta(G)+1$ and $\chi'(H)\le \Delt
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bdabff751020db83afb2f6dcf8c3f2a1
https://doi.org/10.1137/21m1432776
https://doi.org/10.1137/21m1432776
Publikováno v:
Journal of Graph Theory. 101:288-310
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b34e3be11fc97f9f902b0e2b53f0085d
https://doi.org/10.1002/jgt.22825
https://doi.org/10.1002/jgt.22825
Publikováno v:
2022 IEEE 5th Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::05381cec5d96aa8d4081c4f6b504bb72
https://doi.org/10.1109/imcec55388.2022.10019893
https://doi.org/10.1109/imcec55388.2022.10019893
Publikováno v:
SIAM Journal on Discrete Mathematics; 2023, Vol. 37 Issue 3, p1666-1673, 8p
Let $G=(V(G), E(G))$ be a multigraph with maximum degree $\Delta(G)$, chromatic index $\chi'(G)$ and total chromatic number $\chi''(G)$. The Total Coloring conjecture proposed by Behzad and Vizing, independently, states that $\chi''(G)\leq \Delta(G)+
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3747c053bd435bc477298b51c9578f43
http://arxiv.org/abs/2109.07610
http://arxiv.org/abs/2109.07610
Autor:
Guangming Jing, Guantao Chen
Publikováno v:
Journal of Combinatorial Theory, Series B. 139:128-162
Let G be a graph with possible multiple edges but no loops. The density of G, denoted by ρ ( G ) , is defined as max H ⊂ G , | V ( H ) | ≥ 2 ⌈ | E ( H ) | ⌊ | V ( H ) | / 2 ⌋ ⌉ . Goldberg (1973) and Seymour (1974) independently conje
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::97a3b85c6209ebc33676a0855b2196c9
https://doi.org/10.1016/j.jctb.2019.03.004
https://doi.org/10.1016/j.jctb.2019.03.004
Publikováno v:
Journal of Graph Theory. 93:440-449
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::af92a8b02b61a6285a3eb5de7ae25a8f
https://doi.org/10.1002/jgt.22494
https://doi.org/10.1002/jgt.22494
Publikováno v:
Discrete Applied Mathematics. 251:160-170
The Resistance-Harary index of a connected graph G is defined as R H ( G ) = ∑ { u , v } ⊆ V ( G ) 1 r G ( u , v ) , where r G ( u , v ) is the resistance distance between vertices u and v in G . A connected graph G is said to be a cactus if each
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::be45af2a93bbc83cdca41b946f34af80
https://doi.org/10.1016/j.dam.2018.05.042
https://doi.org/10.1016/j.dam.2018.05.042
Autor:
Fei Gong, Yanling Shao, Lihua Zhang, Yubin Gao, Guangming Jing, Zhongshan Li, Wei Fang, Wei Gao
Publikováno v:
Linear Algebra and its Applications. 558:44-62
A sign pattern (matrix) is a matrix whose entries are from the set { + , − , 0 } . The minimum rank (respectively, rational minimum rank) of a sign pattern matrix A is the minimum of the ranks of the real (respectively, rational) matrices whose ent
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9cdb14967d3c4d01a72218b7dfe6be23
https://doi.org/10.1016/j.laa.2018.08.019
https://doi.org/10.1016/j.laa.2018.08.019
Publikováno v:
Cao, Y, Chen, G, Jing, G, Stiebitz, M & Toft, B 2019, ' Graph Edge Coloring : A Survey ', Graphs and Combinatorics, vol. 35, no. 1, pp. 33-66 . https://doi.org/10.1007/s00373-018-1986-5
Graph edge coloring has a rich theory, many applications and beautiful conjectures, and it is studied not only by mathematicians, but also by computer scientists. In this survey, written for the non-expert, we shall describe some main results and tec
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::20cbd8e6493d6f7633fcf5c9a012cb19
https://portal.findresearcher.sdu.dk/da/publications/07b94ca0-2b04-4580-a667-3d0c4773d7c9
https://portal.findresearcher.sdu.dk/da/publications/07b94ca0-2b04-4580-a667-3d0c4773d7c9