Yingqian Wang

发表

The 3-colorability of planar graphs without cycles of length 4, 6 and 9

Ying-li Kang, Li-gang Jin, Yingqian Wang, 2016, Discret. Math..

Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable

Yingqian Wang, Qian Wu, Liang Shen, 2011, Discret. Appl. Math..

Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are (3,1)-colorable

Yingqian Wang, Huajun Zhang, Zhengke Miao, 2018, Discret. Math..

Distance Constraints on Short Cycles for 3-Colorability of Planar graphs

Ying-li Kang, Yingqian Wang, Ying-li Kang, 2015, Graphs Comb..

A new computational framework for anatomically consistent 3D statistical shape analysis with clinical imaging applications

Yingqian Wang, Jia Wu, John C. Brigham, 2013, Comput. methods Biomech. Biomed. Eng. Imaging Vis..

Plane graphs without cycles of length 4, 6, 7 or 8 are 3-colorable

Yingqian Wang, Ming Chen, Liang Shen, 2008, Discret. Math..

Planar graphs with cycles of length neither 4 nor 6 are (2, 0, 0)(2, 0, 0)-colorable

Yingqian Wang, Jinghan Xu, 2013, Inf. Process. Lett..

On the diameter of generalized Kneser graphs

Yingqian Wang, Yongzhu Chen, Yingqian Wang, 2008, Discret. Math..

A structural theorem for planar graphs with some applications

Yingqian Wang, Huiyu Sheng, Yingqian Wang, 2011, Discret. Appl. Math..

Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable

Yingqian Wang, Dingzhu Du, Lan Shen, 2009, Discret. Appl. Math..

Plane Graphs without 4- and 5-Cycles and without Ext-Triangular 7-Cycles are 3-Colorable

Ying-li Kang, Li-gang Jin, Yingqian Wang, 2017, SIAM J. Discret. Math..

On acyclic edge coloring of planar graphs without intersecting triangles

Yingqian Wang, Ping Sheng, Yingqian Wang, 2011, Discret. Math..

Planar graphs with cycles of length neither 4 nor 7 are (3, 0, 0)-colorable

Yingqian Wang, Huihui Li, Jinghan Xu, 2014, Discret. Math..

A note on 3-choosability of planar graphs

Yingqian Wang, Ming Chen, Huajing Lu, 2008, Inf. Process. Lett..

On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles

Ko-Wei Lih, Yingqian Wang, Wei-Fan Wang, 2009, Appl. Math. Lett..

Planar graphs without 4-cycles adjacent to triangles are 4-choosable

Min Chen, Yingqian Wang, Panpan Cheng, 2016, Discret. Math..

Plane Graphs with Maximum Degree Δ≥8 Are Entirely (Δ+3)-Colorable

Yingqian Wang, Zhengke Miao, Xianghua Mao, 2013, J. Graph Theory.

Improved upper bound for acyclic chromatic index of planar graphs without 4-cycles

Yingqian Wang, Ping Sheng, 2014, J. Comb. Optim..

On the 7 Total Colorability of Planar Graphs with Maximum Degree 6 and without 4-cycles

Yingqian Wang, Lan Shen, Yingqian Wang, 2009, Graphs Comb..

Planar graphs without cycles of length 4 or 5 are (2, 0, 0)-colorable

Yingqian Wang, Ming Chen, Peipei Liu, 2016, Discret. Math..

Linear coloring of sparse graphs

Yingqian Wang, Qian Wu, 2012, Discret. Appl. Math..

Every planar graph with cycles of length neither 4 nor 5 is $$(1,1,0)$$-colorable

Yingqian Wang, Lingji Xu, Zhengke Miao, 2014, J. Comb. Optim..

Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph

Yingqian Wang, Jinghan Xu, Jinghan Xu, 2015, Eur. J. Comb..

A sufficient condition for a plane graph with maximum degree 6 to be class 1

Yingqian Wang, Lingji Xu, 2013, Discret. Appl. Math..

Planar graphs without adjacent cycles of length at most five are (1, 1, 0) -colorable

Min Chen, Yingqian Wang, Chuanni Zhang, 2016, Discrete Mathematics.

A relaxation of Havel's 3-color problem

André Raspaud, Yingqian Wang, Mickaël Montassier, 2008, Inf. Process. Lett..

Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable

Yingqian Wang, Lan Shen, Yingqian Wang, 2010, Discret. Math..

Improper colorability of planar graphs without prescribed short cycles

Yingqian Wang, Jinghan Xu, Jinghan Xu, 2014, Discret. Math..

Decomposing a planar graph with girth at least 8 into a forest and a matching

Yingqian Wang, Qijun Zhang, 2011, Discret. Math..

On the 3-colorability of planar graphs without 4-, 7- and 9-cycles

André Raspaud, Yingqian Wang, Mickaël Montassier, 2009, Discret. Math..

$$(1,0,0)$$(1,0,0)-Colorability of planar graphs without prescribed short cycles

Yingqian Wang, Yuehua Bu, Jinghan Xu, 2015, J. Comb. Optim..

Acyclic edge coloring of sparse graphs

Yingqian Wang, Ping Sheng, 2012, Discret. Math..

A sufficient condition for a planar graph to be 3-choosable

Yingqian Wang, Liang Shen, 2007, Inf. Process. Lett..

(3, 1)-Choosability of toroidal graphs with some forbidden short cycles

Yingqian Wang, Yubo Jing, 2015, Discret. Appl. Math..

(1, 0, 0)-colorability of Planar Graphs without Cycles of Length 4, 5 or 9

Yingqian Wang, Yaochou Yang, 2014, Discret. Math..

Every planar graph without cycles of length 4 or 9 is (1, 1, 0)-colorable

Yingqian Wang, Jinghan Xu, Lifeng Dai, 2017, Discret. Math..

Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable

Yingqian Wang, Ming Chen, Huajing Lu, 2010, Discret. Math..

Entire (Δ+2)-colorability of plane graphs

Yingqian Wang, 2014, Eur. J. Comb..

Sufficient conditions for a planar graph to be list edge Δ-colorable and list totally (Δ+1)-colorable

Yingqian Wang, Zhengke Miao, Qiuli Lu, 2013, Discret. Math..

Planar graphs without cycles of length 4 or 5 are (3, 0, 0)(3, 0, 0)-colorable

Yingqian Wang, Gexin Yu, Lingji Xu, 2013, Discret. Math..

(Delta+1)-total-colorability of plane graphs with maximum degree Delta at least 6 and without adjacent short cycles

Yingqian Wang, Jingwen Zhang, Yingqian Wang, 2010, Inf. Process. Lett..

Improper Choosability of Planar Graphs without 4-Cycles

Yingqian Wang, Lingji Xu, 2013, SIAM J. Discret. Math..

(Δ+1)-total-colorability of plane graphs of maximum degree Δ≥6 with neither chordal 5-cycle nor chordal 6-cycle

Yingqian Wang, Qian Wu, Qiuli Lu, 2011, Inf. Process. Lett..

Upper bound of the third edge-connectivity of graphs

Yingqian Wang, Qiao Li, 2005 .

On 3-colorability of planar graphs without adjacent short cycles

Yingqian Wang, Weifan Wang, Weifan Wang, 2010 .

Total colorings of planar graphs with maximum degree at least 8

Yingqian Wang, Lan Shen, 2009 .

Planar graphs without cycles of length from 4 to 6 are(1,0,0)-colorable

Yingqian Wang, Ligang Jin, YingLi Kang, 2013 .

On total chromatic number of planar graphs without 4-cycles

Yingqian Wang, Qiao Li, Qiao Li, 2007 .