Zobrazeno 1 - 10
of 114
pro vyhledávání: '"Huang, Mingfang"'
Autor:
Yang, Haochong1 (AUTHOR) haochong.yang@mail.utoronto.ca, Huang, Mingfang2 (AUTHOR) mh268@students.uwf.edu, Chen, Xinyu2 (AUTHOR) xc8@students.uwf.edu, He, Ziyan3 (AUTHOR) zhe323@wisc.edu, Pu, Shusen2 (AUTHOR) spu@uwf.edu
Publikováno v:
Axioms (2075-1680). Jun2024, Vol. 13 Issue 6, p401. 27p.
Publikováno v:
In Transportation Engineering December 2024 18
Autor:
Huang, Mingfang, Chen, Wei, Liu, Donglin, Zheng, Min, Lin, Lirong, Jiang, Hui, Lin, Kaiyang, Zheng, Xi, Lin, Na, Lin, Feng, Chen, Xinjing, Zhang, Dusheng, Fang, Mingcheng, Hong, Jingxuan, Lu, Lihong, Wu, Zhiyong, Guo, Yansong
Publikováno v:
In International Journal of Cardiology 15 March 2024 399
Autor:
Xiao, Yang, Huang, Mingfang
Publikováno v:
In Discrete Applied Mathematics 15 January 2024 342:391-397
Publikováno v:
In Computers and Electrical Engineering January 2023 105
Publikováno v:
Discrete Mathematics, 2017
A strong edge-coloring of a graph $G=(V,E)$ is a partition of its edge set $E$ into induced matchings. We study bipartite graphs with one part having maximum degree at most $3$ and the other part having maximum degree $\Delta$. We show that every suc
Externí odkaz:
http://arxiv.org/abs/1806.07017
A strong edge-coloring of a graph $G$ is a coloring of the edges such that every color class induces a matching in $G$. The strong chromatic index of a graph is the minimum number of colors needed in a strong edge-coloring of the graph. In 1985, Erd\
Externí odkaz:
http://arxiv.org/abs/1806.07012
Publikováno v:
In Information Fusion September 2021 73:11-21
Publikováno v:
In Computers and Electrical Engineering September 2021 94
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.