Yingqian Wang
Orcid: 0000-0002-0221-3443Affiliations:
- Zhejiang Normal University, Department of Mathematics, Jinhua, China
According to our database1,
Yingqian Wang
authored at least 44 papers
between 2004 and 2022.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2022
Discret. Math., 2022
2018
Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are (3,1)-colorable.
Discret. Math., 2018
2017
Plane Graphs without 4- and 5-Cycles and without Ext-Triangular 7-Cycles are 3-Colorable.
SIAM J. Discret. Math., 2017
Discret. Math., 2017
2016
Planar graphs without adjacent cycles of length at most five are (1, 1, 0) -colorable.
Discret. Math., 2016
Discret. Math., 2016
Discret. Math., 2016
Discret. Math., 2016
2015
J. Comb. Optim., 2015
Graphs Comb., 2015
Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph.
Eur. J. Comb., 2015
Discret. Appl. Math., 2015
2014
J. Comb. Optim., 2014
J. Comb. Optim., 2014
Discret. Math., 2014
Discret. Math., 2014
Discret. Math., 2014
2013
SIAM J. Discret. Math., 2013
J. Graph Theory, 2013
Planar graphs with cycles of length neither 4 nor 6 are (2, 0, 0)(2, 0, 0)-colorable.
Inf. Process. Lett., 2013
Sufficient conditions for a planar graph to be list edge <i>Δ</i>-colorable and list totally (<i>Δ</i>+1)-colorable.
Discret. Math., 2013
Discret. Math., 2013
Discret. Appl. Math., 2013
2012
2011
(Δ+1)-total-colorability of plane graphs of maximum degree Δ≥6 with neither chordal 5-cycle nor chordal 6-cycle.
Inf. Process. Lett., 2011
Discret. Math., 2011
Discret. Math., 2011
Discret. Appl. Math., 2011
Discret. Appl. Math., 2011
2010
(Delta+1)-total-colorability of plane graphs with maximum degree Delta at least 6 and without adjacent short cycles.
Inf. Process. Lett., 2010
Discret. Math., 2010
Discret. Math., 2010
2009
On the 7 Total Colorability of Planar Graphs with Maximum Degree 6 and without 4-cycles.
Graphs Comb., 2009
Discret. Math., 2009
Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable.
Discret. Appl. Math., 2009
On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles.
Appl. Math. Lett., 2009
2008
Discret. Math., 2008
2007
Inf. Process. Lett., 2007
2004