Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Cherry Huang"'
Autor:
Daphne Gold, James Henle, Cherry Huang, Tia Lyve, Tara Marin, Jasmine Osorio, Mäneka Puligandla, Bayla Weick, Jing Xia, He Yun, Jize Zhang
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 13, Iss 1, Pp 1-10 (2016)
Let G be a graph with chromatic number χ(G) and consider a partition P of G into connected subgraphs. P is a puzzle on G if there is a unique vertex coloring of G using 1, 2, …, χ(G) such that the sums of the numbers assigned to the partition pie
Externí odkaz:
https://doaj.org/article/68c4e4276a5449b3b777a4975d11de2f
Autor:
Cherry Huang, 黃秋宜
98
Recently, the international financial environment has suffered from continuous unprecedented financial crisis. Investors have high uncertainty to the future of investment environment. Referring to public information, many well-known credit ra
Recently, the international financial environment has suffered from continuous unprecedented financial crisis. Investors have high uncertainty to the future of investment environment. Referring to public information, many well-known credit ra
Externí odkaz:
http://ndltd.ncl.edu.tw/handle/68211714133223045800
Autor:
John G Blickle, Leslie Vojta, Cherry Huang, Jacob M Wyse, Angela M Yarnell, Joshua D Hartzell
Publikováno v:
Military medicine. 187(5-6)
Medical students at the Uniformed Services University of the Health Sciences participate in a leadership curriculum designed to develop leadership skills. Operation Bushmaster is a 5-day field practicum designed to test these skills. In this article,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7767683513ac88dfd44e1c0616e02c34
https://pubmed.ncbi.nlm.nih.gov/35284928
https://pubmed.ncbi.nlm.nih.gov/35284928
Autor:
Tara Marin, Jasmine Osorio, He Yun, Mäneka Puligandla, Tia Lyve, Jize Zhang, James M. Henle, Jing Xia, Daphne Gold, Cherry Huang, Bayla Weick
Publikováno v:
AKCE International Journal of Graphs and Combinatorics, Vol 13, Iss 1, Pp 1-10 (2016)
Let G be a graph with chromatic number χ ( G ) and consider a partition P of G into connected subgraphs. P is a puzzle on G if there is a unique vertex coloring of G using 1, 2, …, χ ( G ) such that the sums of the numbers assigned to the partiti
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7d03ce291aa528e62f0cbc4c407599f9
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.