Super restricted edge-connectivity of vertex-transitive graphs. - Yingqian Wang 001 (Discret. Math., 2004)

A sufficient condition for a planar graph to be 3-choosable. - Liang Shen; Yingqian Wang 001 (Inf. Process. Lett., 2007)

On the diameter of generalized Kneser graphs. - Yongzhu Chen; Yingqian Wang 001 (Discret. Math., 2008)

Plane graphs without cycles of length 4, 6, 7 or 8 are 3-colorable. - Yingqian Wang 001; Ming Chen 015; Liang Shen (Discret. Math., 2008)

A relaxation of Havel's 3-color problem. - Mickaël Montassier; André Raspaud; Weifan Wang 001; Yingqian Wang 001 (Inf. Process. Lett., 2008)

A note on 3-choosability of planar graphs. - Yingqian Wang 001; Huajing Lu; Ming Chen 015 (Inf. Process. Lett., 2008)

On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles. - Lan Shen; Yingqian Wang 001; Wei-Fan Wang 001; Ko-Wei Lih (Appl. Math. Lett., 2009)

Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable. - Dingzhu Du; Lan Shen; Yingqian Wang 001 (Discret. Appl. Math., 2009)

On the 3-colorability of planar graphs without 4-, 7- and 9-cycles. - Huajing Lu; Yingqian Wang 001; Weifan Wang 001; Yuehua Bu; Mickaël Montassier; André Raspaud (Discret. Math., 2009)

On the 7 Total Colorability of Planar Graphs with Maximum Degree 6 and without 4-cycles. - Lan Shen; Yingqian Wang 001 (Graphs Comb., 2009)

Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable. - Lan Shen; Yingqian Wang 001 (Discret. Math., 2010)

Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable. - Yingqian Wang 001; Huajing Lu; Ming Chen 015 (Discret. Math., 2010)

(Delta+1)-total-colorability of plane graphs with maximum degree Delta at least 6 and without adjacent short cycles. - Jingwen Zhang; Yingqian Wang 001 (Inf. Process. Lett., 2010)

A structural theorem for planar graphs with some applications. - Huiyu Sheng; Yingqian Wang 001 (Discret. Appl. Math., 2011)

Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable. - Yingqian Wang 001; Qian Wu; Liang Shen (Discret. Appl. Math., 2011)

On acyclic edge coloring of planar graphs without intersecting triangles. - Ping Sheng; Yingqian Wang 001 (Discret. Math., 2011)

Decomposing a planar graph with girth at least 8 into a forest and a matching. - Yingqian Wang 001; Qijun Zhang (Discret. Math., 2011)

(Δ+1)-total-colorability of plane graphs of maximum degree Δ≥6 with neither chordal 5-cycle nor chordal 6-cycle. - Qian Wu; Qiuli Lu; Yingqian Wang 001 (Inf. Process. Lett., 2011)

Linear coloring of sparse graphs. - Yingqian Wang 001; Qian Wu (Discret. Appl. Math., 2012)

Acyclic edge coloring of sparse graphs. - Yingqian Wang 001; Ping Sheng (Discret. Math., 2012)

A sufficient condition for a plane graph with maximum degree 6 to be class 1. - Yingqian Wang 001; Lingji Xu (Discret. Appl. Math., 2013)

Planar graphs without cycles of length 4 or 5 are (3, 0, 0)(3, 0, 0)-colorable. - Owen Hill; Diana Smith; Yingqian Wang 001; Lingji Xu; Gexin Yu (Discret. Math., 2013)

Sufficient conditions for a planar graph to be list edge Δ-colorable and list totally (Δ+1)-colorable. - Qiuli Lu; Zhengke Miao; Yingqian Wang 001 (Discret. Math., 2013)

Planar graphs with cycles of length neither 4 nor 6 are (2, 0, 0)(2, 0, 0)-colorable. - Yingqian Wang 001; Jinghan Xu (Inf. Process. Lett., 2013)

Plane Graphs with Maximum Degree Δ≥8 Are Entirely (Δ+3)-Colorable. - Yingqian Wang 001; Xianghua Mao; Zhengke Miao (J. Graph Theory, 2013)

Improper Choosability of Planar Graphs without 4-Cycles. - Yingqian Wang 001; Lingji Xu (SIAM J. Discret. Math., 2013)

Planar graphs with cycles of length neither 4 nor 7 are (3, 0, 0)-colorable. - Huihui Li; Jinghan Xu; Yingqian Wang 001 (Discret. Math., 2014)

Improper colorability of planar graphs without prescribed short cycles. - Yingqian Wang 001; Jinghan Xu (Discret. Math., 2014)

(1, 0, 0)-colorability of planar graphs without cycles of length 4, 5 or 9. - Yingqian Wang 001; Yaochou Yang (Discret. Math., 2014)

Entire (Δ+2)-colorability of plane graphs. - Yingqian Wang 001 (Eur. J. Comb., 2014)

Improved upper bound for acyclic chromatic index of planar graphs without 4-cycles. - Yingqian Wang 001; Ping Sheng (J. Comb. Optim., 2014)

Every planar graph with cycles of length neither 4 nor 5 is (1, 1, 0)-colorable. - Lingji Xu; Zhengke Miao; Yingqian Wang 001 (J. Comb. Optim., 2014)

(3, 1)-Choosability of toroidal graphs with some forbidden short cycles. - Yubo Jing; Yingqian Wang 001 (Discret. Appl. Math., 2015)

Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph. - Yingqian Wang 001; Jinghan Xu (Eur. J. Comb., 2015)

Distance Constraints on Short Cycles for 3-Colorability of Planar graphs. - Ying-li Kang; Yingqian Wang 001 (Graphs Comb., 2015)

(1, 0, 0)-Colorability of planar graphs without prescribed short cycles. - Yuehua Bu; Jinghan Xu; Yingqian Wang 001 (J. Comb. Optim., 2015)

Planar graphs without cycles of length 4 or 5 are (2, 0, 0)-colorable. - Ming Chen 015; Yingqian Wang 001; Peipei Liu; Jinghan Xu (Discret. Math., 2016)

Planar graphs without 4-cycles adjacent to triangles are 4-choosable. - Panpan Cheng; Min Chen 012; Yingqian Wang 001 (Discret. Math., 2016)

The 3-colorability of planar graphs without cycles of length 4, 6 and 9. - Ying-li Kang; Ligang Jin; Yingqian Wang 001 (Discret. Math., 2016)

Planar graphs without adjacent cycles of length at most five are (1, 1, 0) -colorable. - Chuanni Zhang; Yingqian Wang 001; Min Chen 012 (Discret. Math., 2016)

Every planar graph without cycles of length 4 or 9 is (1, 1, 0)-colorable. - Lifeng Dai; Yingqian Wang 001; Jinghan Xu (Discret. Math., 2017)

Plane Graphs without 4- and 5-Cycles and without Ext-Triangular 7-Cycles are 3-Colorable. - Ligang Jin; Ying-li Kang; Michael Schubert; Yingqian Wang 001 (SIAM J. Discret. Math., 2017)

Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are (3,1)-colorable. - Zhengke Miao; Yingqian Wang 001; Chuanni Zhang; Huajun Zhang (Discret. Math., 2018)

(1, 0, 0)-colorability of planar graphs without cycles of length 4 or 6. - Yingli Kang; Ligang Jin; Peipei Liu; Yingqian Wang 001 (Discret. Math., 2022)