A structural theorem for planar graphs with some applicationsHUIYU SHENG; YINGQIAN WANG.Discrete applied mathematics. 2011, Vol 159, Num 11, pp 1183-1187, issn 0166-218X, 5 p.Article

Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorableLAN SHEN; YINGQIAN WANG.Discrete mathematics. 2010, Vol 310, Num 17-18, pp 2372-2379, issn 0012-365X, 8 p.Article

On the diameter of generalized Kneser graphsYONGZHU CHEN; YINGQIAN WANG.Discrete mathematics. 2008, Vol 308, Num 18, pp 4276-4279, issn 0012-365X, 4 p.Article

On acyclic edge coloring of planar graphs without intersecting trianglesPING SHENG; YINGQIAN WANG.Discrete mathematics. 2011, Vol 311, Num 21, pp 2490-2495, issn 0012-365X, 6 p.Article

Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorableDINGZHU DU; LAN SHEN; YINGQIAN WANG et al.Discrete applied mathematics. 2009, Vol 157, Num 13, pp 2778-2784, issn 0166-218X, 7 p.Article

Decomposing a planar graph with girth at least 8 into a forest and a matchingYINGQIAN WANG; QIJUN ZHANG.Discrete mathematics. 2011, Vol 311, Num 10-11, pp 844-849, issn 0012-365X, 6 p.Article

A sufficient condition for a planar graph to be 3-choosableLIANG SHEN; YINGQIAN WANG.Information processing letters. 2007, Vol 104, Num 4, pp 146-151, issn 0020-0190, 6 p.Article

(Δ + 1 )-total-colorability of plane graphs of maximum degree Δ ≥ 6 with neither chordal 5-cycle nor chordal 6-cycleQIAN WU; QIULI LU; YINGQIAN WANG et al.Information processing letters. 2011, Vol 111, Num 15, pp 767-772, issn 0020-0190, 6 p.Article

Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosableYINGQIAN WANG; HUAJING LU; MING CHEN et al.Discrete mathematics. 2010, Vol 310, Num 1, pp 147-158, issn 0012-365X, 12 p.Article

Plane graphs without cycles of length 4, 6, 7 or 8 are 3-colorableYINGQIAN WANG; MING CHEN; LIANG SHEN et al.Discrete mathematics. 2008, Vol 308, Num 17, pp 4014-4017, issn 0012-365X, 4 p.Article

A silver-palladium thick film for aluminum nitride substrateDONGFENG ZHENG; MINBO TIAN; YINGQIAN WANG et al.Pigment & resin technology. 2003, Vol 32, Num 1, pp 30-33, issn 0369-9420, 4 p.Article

Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosableYINGQIAN WANG; QIAN WU; LIANG SHEN et al.Discrete applied mathematics. 2011, Vol 159, Num 4, pp 232-239, issn 0166-218X, 8 p.Article

A note on 3-choosability of planar graphsYINGQIAN WANG; HUAJING LU; MING CHEN et al.Information processing letters. 2008, Vol 105, Num 5, pp 206-211, issn 0020-0190, 6 p.Article

A relaxation of Havel's 3-color problemMONTASSIER, Mickaël; RASPAUD, André; WEIFAN WANG et al.Information processing letters. 2008, Vol 107, Num 3-4, pp 107-109, issn 0020-0190, 3 p.Article

On the 3-colorability of planar graphs without 4-, 7- and 9-cyclesHUAJING LU; YINGQIAN WANG; WEIFAN WANG et al.Discrete mathematics. 2009, Vol 309, Num 13, pp 4596-4607, issn 0012-365X, 12 p.Article