Yingqian Wang

44 papers Journal 44
YearRankTypeTitle / Venue / Authors
2022 J jnl
(1, 0, 0)-colorability of planar graphs without cycles of length 4 or 6.
Discret. Math.
Yingli Kang, Ligang Jin, Peipei Liu, Yingqian Wang
2018 J jnl
Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are (3,1)-colorable.
Discret. Math.
Zhengke Miao, Yingqian Wang, Chuanni Zhang, Huajun Zhang
2017 J jnl
Every planar graph without cycles of length 4 or 9 is (1, 1, 0)-colorable.
Discret. Math.
Lifeng Dai, Yingqian Wang, Jinghan Xu
2017 J jnl
Plane Graphs without 4- and 5-Cycles and without Ext-Triangular 7-Cycles are 3-Colorable.
SIAM J. Discret. Math.
Ligang Jin, Ying-li Kang, Michael Schubert, Yingqian Wang
2016 J jnl
Planar graphs without 4-cycles adjacent to triangles are 4-choosable.
Discret. Math.
Panpan Cheng, Min Chen, Yingqian Wang
2016 J jnl
Planar graphs without adjacent cycles of length at most five are (1, 1, 0) -colorable.
Discret. Math.
Chuanni Zhang, Yingqian Wang, Min Chen
2016 J jnl
Planar graphs without cycles of length 4 or 5 are (2, 0, 0)-colorable.
Discret. Math.
Ming Chen, Yingqian Wang, Peipei Liu, Jinghan Xu
2016 J jnl
The 3-colorability of planar graphs without cycles of length 4, 6 and 9.
Discret. Math.
Ying-li Kang, Ligang Jin, Yingqian Wang
2015 J jnl
(1, 0, 0)-Colorability of planar graphs without prescribed short cycles.
J. Comb. Optim.
Yuehua Bu, Jinghan Xu, Yingqian Wang
2015 J jnl
(3, 1)-Choosability of toroidal graphs with some forbidden short cycles.
Discret. Appl. Math.
Yubo Jing, Yingqian Wang
2015 J jnl
Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph.
Eur. J. Comb.
Yingqian Wang, Jinghan Xu
2015 J jnl
Distance Constraints on Short Cycles for 3-Colorability of Planar graphs.
Graphs Comb.
Ying-li Kang, Yingqian Wang
2014 J jnl
(1, 0, 0)-colorability of planar graphs without cycles of length 4, 5 or 9.
Discret. Math.
Yingqian Wang, Yaochou Yang
2014 J jnl
Entire (Δ+2)-colorability of plane graphs.
Eur. J. Comb.
Yingqian Wang
2014 J jnl
Every planar graph with cycles of length neither 4 nor 5 is (1, 1, 0)-colorable.
J. Comb. Optim.
Lingji Xu, Zhengke Miao, Yingqian Wang
2014 J jnl
Improper colorability of planar graphs without prescribed short cycles.
Discret. Math.
Yingqian Wang, Jinghan Xu
2014 J jnl
Improved upper bound for acyclic chromatic index of planar graphs without 4-cycles.
J. Comb. Optim.
Yingqian Wang, Ping Sheng
2014 J jnl
Planar graphs with cycles of length neither 4 nor 7 are (3, 0, 0)-colorable.
Discret. Math.
Huihui Li, Jinghan Xu, Yingqian Wang
2013 J jnl
A sufficient condition for a plane graph with maximum degree 6 to be class 1.
Discret. Appl. Math.
Yingqian Wang, Lingji Xu
2013 J jnl
Improper Choosability of Planar Graphs without 4-Cycles.
SIAM J. Discret. Math.
Yingqian Wang, Lingji Xu
2013 J jnl
Planar graphs with cycles of length neither 4 nor 6 are (2, 0, 0)(2, 0, 0)-colorable.
Inf. Process. Lett.
Yingqian Wang, Jinghan Xu
2013 J jnl
Planar graphs without cycles of length 4 or 5 are (3, 0, 0)(3, 0, 0)-colorable.
Discret. Math.
Owen Hill, Diana Smith, Yingqian Wang, Lingji Xu, Gexin Yu
2013 J jnl
Plane Graphs with Maximum Degree Δ≥8 Are Entirely (Δ+3)-Colorable.
J. Graph Theory
Yingqian Wang, Xianghua Mao, Zhengke Miao
2013 J jnl
Sufficient conditions for a planar graph to be list edge
Discret. Math.
Qiuli Lu, Zhengke Miao, Yingqian Wang
2012 J jnl
Acyclic edge coloring of sparse graphs.
Discret. Math.
Yingqian Wang, Ping Sheng
2012 J jnl
Linear coloring of sparse graphs.
Discret. Appl. Math.
Yingqian Wang, Qian Wu
2011 J jnl
(Δ+1)-total-colorability of plane graphs of maximum degree Δ≥6 with neither chordal 5-cycle nor chordal 6-cycle.
Inf. Process. Lett.
Qian Wu, Qiuli Lu, Yingqian Wang
2011 J jnl
A structural theorem for planar graphs with some applications.
Discret. Appl. Math.
Huiyu Sheng, Yingqian Wang
2011 J jnl
Decomposing a planar graph with girth at least 8 into a forest and a matching.
Discret. Math.
Yingqian Wang, Qijun Zhang
2011 J jnl
On acyclic edge coloring of planar graphs without intersecting triangles.
Discret. Math.
Ping Sheng, Yingqian Wang
2011 J jnl
Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable.
Discret. Appl. Math.
Yingqian Wang, Qian Wu, Liang Shen
2010 J jnl
(Delta+1)-total-colorability of plane graphs with maximum degree Delta at least 6 and without adjacent short cycles.
Inf. Process. Lett.
Jingwen Zhang, Yingqian Wang
2010 J jnl
Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable.
Discret. Math.
Lan Shen, Yingqian Wang
2010 J jnl
Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable.
Discret. Math.
Yingqian Wang, Huajing Lu, Ming Chen
2009 J jnl
On the 3-colorability of planar graphs without 4-, 7- and 9-cycles.
Discret. Math.
Huajing Lu, Yingqian Wang, Weifan Wang, Yuehua Bu, Mickaël Montassier, André Raspaud
2009 J jnl
On the 7 Total Colorability of Planar Graphs with Maximum Degree 6 and without 4-cycles.
Graphs Comb.
Lan Shen, Yingqian Wang
2009 J jnl
On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles.
Appl. Math. Lett.
Lan Shen, Yingqian Wang, Wei-Fan Wang, Ko-Wei Lih
2009 J jnl
Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable.
Discret. Appl. Math.
Dingzhu Du, Lan Shen, Yingqian Wang
2008 J jnl
A note on 3-choosability of planar graphs.
Inf. Process. Lett.
Yingqian Wang, Huajing Lu, Ming Chen
2008 J jnl
A relaxation of Havel's 3-color problem.
Inf. Process. Lett.
Mickaël Montassier, André Raspaud, Weifan Wang, Yingqian Wang
2008 J jnl
On the diameter of generalized Kneser graphs.
Discret. Math.
Yongzhu Chen, Yingqian Wang
2008 J jnl
Plane graphs without cycles of length 4, 6, 7 or 8 are 3-colorable.
Discret. Math.
Yingqian Wang, Ming Chen, Liang Shen
2007 J jnl
A sufficient condition for a planar graph to be 3-choosable.
Inf. Process. Lett.
Liang Shen, Yingqian Wang
2004 J jnl
Super restricted edge-connectivity of vertex-transitive graphs.
Discret. Math.
Yingqian Wang