Zobrazeno 1 - 10
of 1 852
pro vyhledávání: '"Luo, Cong"'
A graph is called $k$-critical if its chromatic number is $k$ but any proper subgraph has chromatic number less than $k$. An old and important problem in graph theory asks to determine the maximum number of edges in an $n$-vertex $k$-critical graph.
Externí odkaz:
http://arxiv.org/abs/2301.01656
Publikováno v:
In Environmental and Experimental Botany October 2024 226
Publikováno v:
In Process Biochemistry October 2024 145:229-242
Autor:
Zha, Xiaojian, Zhang, Zewu, Zhao, Zhenghong, Yang, Long, Mao, Wenchao, Wu, Fan, Li, Xiaoshan, Luo, Cong, Zhang, Liqi
Publikováno v:
In Energy 1 October 2024 305
Autor:
Li, Zheng-Mei, Lin, Yan, Luo, Cong-hui, Sun, Qiu-Li, Mi, Chun-Liu, Wang, Xiao-yin, Wang, Tian-Yun
Publikováno v:
In Journal of Biotechnology 10 September 2024 392:96-102
Publikováno v:
In Carbon Capture Science & Technology September 2024 12
Autor:
Tang, Shichuan, Huang, Tingfeng, Luo, Cong, Fu, Jun, Zhang, Kailing, Chen, Qingjing, Kong, Jie, Zhang, Jianxi, Sun, Zhenghong, Diao, Yongkang, Lin, Kongying, Zeng, Yongyi
Publikováno v:
In iLIVER September 2024 3(3)
Publikováno v:
In Advanced Drug Delivery Reviews September 2024 212
Autor:
Wu, Jiaping, Zhang, Xuan, Sun, Dongqi, Shi, Xianbao, Sun, Jin, Luo, Cong, He, Zhonggui, Zhang, Shenwu
Publikováno v:
In Chemical Engineering Journal 1 September 2024 495
Publikováno v:
In Heliyon 15 August 2024 10(15)