Yingqian Wang

According to our database, Yingqian Wang authored at least 44 papers between 2004 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2022

(1, 0, 0)-colorability of planar graphs without cycles of length 4 or 6.

Yingli Kang, Ligang Jin, Peipei Liu, Yingqian Wang

Discret. Math., 2022

2018

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

Zhengke Miao, Yingqian Wang, Chuanni Zhang, Huajun Zhang

Discret. Math., 2018

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

SIAM J. Discret. Math., 2017

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

Lifeng Dai, Yingqian Wang, Jinghan Xu

Discret. Math., 2017

2016

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

Chuanni Zhang, Yingqian Wang, Min Chen

Discret. Math., 2016

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

Ying-li Kang, Ligang Jin, Yingqian Wang

Discret. Math., 2016

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

Panpan Cheng, Min Chen, Yingqian Wang

Discret. Math., 2016

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

Ming Chen, Yingqian Wang, Peipei Liu, Jinghan Xu

Discret. Math., 2016

2015

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

Yuehua Bu, Jinghan Xu, Yingqian Wang

J. Comb. Optim., 2015

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

Ying-li Kang, Yingqian Wang

Graphs Comb., 2015

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

Yingqian Wang, Jinghan Xu

Eur. J. Comb., 2015

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

Yubo Jing, Yingqian Wang

Discret. Appl. Math., 2015

2014

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

Lingji Xu, Zhengke Miao, Yingqian Wang

J. Comb. Optim., 2014

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

Yingqian Wang, Ping Sheng

J. Comb. Optim., 2014

Entire (Δ+2)-colorability of plane graphs.

Yingqian Wang

Eur. J. Comb., 2014

(1, 0, 0)-colorability of planar graphs without cycles of length 4, 5 or 9.

Yingqian Wang, Yaochou Yang

Discret. Math., 2014

Improper colorability of planar graphs without prescribed short cycles.

Yingqian Wang, Jinghan Xu

Discret. Math., 2014

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

Huihui Li, Jinghan Xu, Yingqian Wang

Discret. Math., 2014

2013

Improper Choosability of Planar Graphs without 4-Cycles.

Yingqian Wang, Lingji Xu

SIAM J. Discret. Math., 2013

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

Yingqian Wang, Xianghua Mao, Zhengke Miao

J. Graph Theory, 2013

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

Yingqian Wang, Jinghan Xu

Inf. Process. Lett., 2013

Sufficient conditions for a planar graph to be list edge <i>Δ</i>-colorable and list totally (<i>Δ</i>+1)-colorable.

Qiuli Lu, Zhengke Miao, Yingqian Wang

Discret. 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, Lingji Xu, Gexin Yu

Discret. Math., 2013

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

Yingqian Wang, Lingji Xu

Discret. Appl. Math., 2013

2012

Acyclic edge coloring of sparse graphs.

Yingqian Wang, Ping Sheng

Discret. Math., 2012

Linear coloring of sparse graphs.

Yingqian Wang, Qian Wu

Discret. Appl. Math., 2012

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

Inf. Process. Lett., 2011

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

Yingqian Wang, Qijun Zhang

Discret. Math., 2011

On acyclic edge coloring of planar graphs without intersecting triangles.

Ping Sheng, Yingqian Wang

Discret. Math., 2011

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

Yingqian Wang, Qian Wu, Liang Shen

Discret. Appl. Math., 2011

A structural theorem for planar graphs with some applications.

Huiyu Sheng, Yingqian Wang

Discret. Appl. Math., 2011

2010

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

Jingwen Zhang, Yingqian Wang

Inf. Process. Lett., 2010

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

Yingqian Wang, Huajing Lu, Ming Chen

Discret. Math., 2010

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

Lan Shen, Yingqian Wang

Discret. Math., 2010

2009

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

Lan Shen, Yingqian Wang

Graphs Comb., 2009

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

Huajing Lu, Yingqian Wang, Weifan Wang, Yuehua Bu, Mickaël Montassier, André Raspaud

Discret. Math., 2009

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

Dingzhu Du, Lan Shen, Yingqian Wang

Discret. Appl. Math., 2009

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

Lan Shen, Yingqian Wang, Wei-Fan Wang, Ko-Wei Lih

Appl. Math. Lett., 2009

2008

A note on 3-choosability of planar graphs.

Yingqian Wang, Huajing Lu, Ming Chen

Inf. Process. Lett., 2008

A relaxation of Havel's 3-color problem.

Mickaël Montassier, André Raspaud, Weifan Wang, Yingqian Wang

Inf. Process. Lett., 2008

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

Yingqian Wang, Ming Chen, Liang Shen

Discret. Math., 2008

On the diameter of generalized Kneser graphs.

Yongzhu Chen, Yingqian Wang

Discret. Math., 2008

2007

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

Liang Shen, Yingqian Wang

Inf. Process. Lett., 2007

2004

Super restricted edge-connectivity of vertex-transitive graphs.

Yingqian Wang

Discret. Math., 2004