Yingqian Wang

Publication Activity (10 Years)

Years Active: 2004-2022
Publications (10 Years): 8

Top Topics

Partition Function

Top Venues

J. Comb. Optim.

Discret. Appl. Math.

SIAM J. Discret. Math.

Publications

Yingli Kang, Ligang Jin, Peipei Liu, Yingqian Wang
(1, 0, 0)-colorability of planar graphs without cycles of length 4 or 6. Discret. Math. 345 (4) (2022)
Zhengke Miao, Yingqian Wang, Chuanni Zhang, Huajun Zhang
Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are (3,1)-colorable. Discret. Math. 341 (3) (2018)
Ligang Jin, Ying-li Kang, Michael Schubert, Yingqian Wang
Plane Graphs without 4- and 5-Cycles and without Ext-Triangular 7-Cycles are 3-Colorable. SIAM J. Discret. Math. 31 (3) (2017)
Lifeng Dai, Yingqian Wang, Jinghan Xu
Every planar graph without cycles of length 4 or 9 is (1, 1, 0)-colorable. Discret. Math. 340 (9) (2017)
Ying-li Kang, Ligang Jin, Yingqian Wang
The 3-colorability of planar graphs without cycles of length 4, 6 and 9. Discret. Math. 339 (1) (2016)
Ming Chen, Yingqian Wang, Peipei Liu, Jinghan Xu
Planar graphs without cycles of length 4 or 5 are (2, 0, 0)-colorable. Discret. Math. 339 (2) (2016)
Panpan Cheng, Min Chen, Yingqian Wang
Planar graphs without 4-cycles adjacent to triangles are 4-choosable. Discret. Math. 339 (12) (2016)
Chuanni Zhang, Yingqian Wang, Min Chen
Planar graphs without adjacent cycles of length at most five are (1, 1, 0) -colorable. Discret. Math. 339 (12) (2016)
Yubo Jing, Yingqian Wang
(3, 1)-Choosability of toroidal graphs with some forbidden short cycles. Discret. Appl. Math. 184 (2015)
Yuehua Bu, Jinghan Xu, Yingqian Wang
(1, 0, 0)-Colorability of planar graphs without prescribed short cycles. J. Comb. Optim. 30 (3) (2015)
Ying-li Kang, Yingqian Wang
Distance Constraints on Short Cycles for 3-Colorability of Planar graphs. Graphs Comb. 31 (5) (2015)
Yingqian Wang, Jinghan Xu
Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph. Eur. J. Comb. 43 (2015)
Yingqian Wang, Ping Sheng
Improved upper bound for acyclic chromatic index of planar graphs without 4-cycles. J. Comb. Optim. 27 (3) (2014)
Yingqian Wang
Entire (Δ+2)-colorability of plane graphs. Eur. J. Comb. 38 (2014)
Yingqian Wang, Yaochou Yang
(1, 0, 0)-colorability of planar graphs without cycles of length 4, 5 or 9. Discret. Math. 326 (2014)
Yingqian Wang, Jinghan Xu
Improper colorability of planar graphs without prescribed short cycles. Discret. Math. 322 (2014)
Lingji Xu, Zhengke Miao, Yingqian Wang
Every planar graph with cycles of length neither 4 nor 5 is (1, 1, 0)-colorable. J. Comb. Optim. 28 (4) (2014)
Huihui Li, Jinghan Xu, Yingqian Wang
Planar graphs with cycles of length neither 4 nor 7 are (3, 0, 0)-colorable. Discret. Math. 327 (2014)
Owen Hill, Diana Smith, Yingqian Wang, Lingji Xu, Gexin Yu
Planar graphs without cycles of length 4 or 5 are (3, 0, 0)(3, 0, 0)-colorable. Discret. Math. 313 (20) (2013)
Yingqian Wang, Xianghua Mao, Zhengke Miao
Plane Graphs with Maximum Degree Δ≥8 Are Entirely (Δ+3)-Colorable. J. Graph Theory 73 (3) (2013)
Yingqian Wang, Lingji Xu
A sufficient condition for a plane graph with maximum degree 6 to be class 1. Discret. Appl. Math. 161 (1-2) (2013)
Yingqian Wang, Jinghan Xu
Planar graphs with cycles of length neither 4 nor 6 are (2, 0, 0)(2, 0, 0)-colorable. Inf. Process. Lett. 113 (18) (2013)
Yingqian Wang, Lingji Xu
Improper Choosability of Planar Graphs without 4-Cycles. SIAM J. Discret. Math. 27 (4) (2013)
Qiuli Lu, Zhengke Miao, Yingqian Wang
+1)-colorable. Discret. Math. 313 (5) (2013)
Yingqian Wang, Ping Sheng
Acyclic edge coloring of sparse graphs. Discret. Math. 312 (24) (2012)
Yingqian Wang, Qian Wu
Linear coloring of sparse graphs. Discret. Appl. Math. 160 (4-5) (2012)
Ping Sheng, Yingqian Wang
On acyclic edge coloring of planar graphs without intersecting triangles. Discret. Math. 311 (21) (2011)
Yingqian Wang, Qian Wu, Liang Shen
Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable. Discret. Appl. Math. 159 (4) (2011)
Qian Wu, Qiuli Lu, Yingqian Wang
(Δ+1)-total-colorability of plane graphs of maximum degree Δ≥6 with neither chordal 5-cycle nor chordal 6-cycle. Inf. Process. Lett. 111 (15) (2011)
Huiyu Sheng, Yingqian Wang
A structural theorem for planar graphs with some applications. Discret. Appl. Math. 159 (11) (2011)
Yingqian Wang, Qijun Zhang
Decomposing a planar graph with girth at least 8 into a forest and a matching. Discret. Math. 311 (10-11) (2011)
Yingqian Wang, Huajing Lu, Ming Chen
Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable. Discret. Math. 310 (1) (2010)
Jingwen Zhang, Yingqian Wang
(Delta+1)-total-colorability of plane graphs with maximum degree Delta at least 6 and without adjacent short cycles. Inf. Process. Lett. 110 (18-19) (2010)
Lan Shen, Yingqian Wang
Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable. Discret. Math. 310 (17-18) (2010)
Lan Shen, Yingqian Wang
On the 7 Total Colorability of Planar Graphs with Maximum Degree 6 and without 4-cycles. Graphs Comb. 25 (3) (2009)
Dingzhu Du, Lan Shen, Yingqian Wang
Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable. Discret. Appl. Math. 157 (13) (2009)
Huajing Lu, Yingqian Wang, Weifan Wang, Yuehua Bu, Mickaël Montassier, André Raspaud
On the 3-colorability of planar graphs without 4-, 7- and 9-cycles. Discret. Math. 309 (13) (2009)
Lan Shen, Yingqian Wang, Wei-Fan Wang, Ko-Wei Lih
On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles. Appl. Math. Lett. 22 (9) (2009)
Yongzhu Chen, Yingqian Wang
On the diameter of generalized Kneser graphs. Discret. Math. 308 (18) (2008)
Mickaël Montassier, André Raspaud, Weifan Wang, Yingqian Wang
A relaxation of Havel's 3-color problem. Inf. Process. Lett. 107 (3-4) (2008)
Yingqian Wang, Ming Chen, Liang Shen
Plane graphs without cycles of length 4, 6, 7 or 8 are 3-colorable. Discret. Math. 308 (17) (2008)
Yingqian Wang, Huajing Lu, Ming Chen
A note on 3-choosability of planar graphs. Inf. Process. Lett. 105 (5) (2008)
Liang Shen, Yingqian Wang
A sufficient condition for a planar graph to be 3-choosable. Inf. Process. Lett. 104 (4) (2007)
Yingqian Wang
Super restricted edge-connectivity of vertex-transitive graphs. Discret. Math. 289 (1-3) (2004)