| Publication | Date of Publication | Type |
|---|
Planar graphs without cycles of length 4 or 5 are (7 : 2)-colorable
Discrete Applied Mathematics | 2026-01-28 | Paper |
Planar graphs without cycles of length 4 or 9 are $\boldsymbol{(2,~0,~0)}$-colorable
SCIENTIA SINICA Mathematica | 2022-03-21 | Paper |
\((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\)
Discrete Mathematics | 2022-02-14 | Paper |
Plane graphs with maximum degree 7 and without 5-cycles with chords are 8-totally-colorable
SCIENTIA SINICA Mathematica | 2021-12-17 | Paper |
Improper colorability of planar graphs with cycles of length neither 4 nor 6
SCIENTIA SINICA Mathematica | 2021-12-17 | Paper |
Planar graphs without cycles of length from 4 to 6 are \((1,0,0)\)-colorable
SCIENTIA SINICA Mathematica | 2021-12-17 | Paper |
Planar graphs without cycles of length 4 or 7 are \((2, 0, 0)\)-colorable
SCIENTIA SINICA Mathematica | 2021-12-17 | Paper |
A sufficient condition for a planar graph to be 3-colorable
SCIENTIA SINICA Mathematica | 2021-12-17 | Paper |
| A note on improper colorability of planar graphs | 2018-05-25 | Paper |
Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are \((3, 1)\)-colorable
Discrete Mathematics | 2018-01-19 | Paper |
Plane graphs without 4- and 5-cycles and without ext-triangular 7-cycles are 3-colorable
SIAM Journal on Discrete Mathematics | 2017-08-31 | Paper |
Every planar graph without cycles of length 4 or 9 is \((1, 1, 0)\)-colorable
Discrete Mathematics | 2017-06-23 | Paper |
| scientific article; zbMATH DE number 6718589 (Why is no real title available?) | 2017-05-17 | Paper |
A note on 3-choosability of planar graphs
Journal of Zhejiang Normal University. Natural Sciences | 2016-10-06 | Paper |
Improved upper bound of linear 2-arboricity of planar graphs
Advances in Mathematics (Beijing) | 2016-10-06 | Paper |
Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable
Discrete Mathematics | 2016-08-16 | Paper |
Planar graphs without 4-cycles adjacent to triangles are 4-choosable
Discrete Mathematics | 2016-08-16 | Paper |
Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable
Discrete Mathematics | 2015-12-08 | Paper |
The 3-colorability of planar graphs without cycles of length 4, 6 and 9
Discrete Mathematics | 2015-10-08 | Paper |
\((1,0,0)\)-colorability of planar graphs without prescribed short cycles
Journal of Combinatorial Optimization | 2015-09-28 | Paper |
Distance constraints on short cycles for 3-colorability of planar graphs
Graphs and Combinatorics | 2015-09-24 | Paper |
(3, 1)-choosability of toroidal graphs with some forbidden short cycles
Discrete Applied Mathematics | 2015-04-28 | Paper |
Every planar graph with cycles of length neither 4 nor 5 is \((1,1,0)\)-colorable
Journal of Combinatorial Optimization | 2015-01-21 | Paper |
Decomposing a planar graph without cycles of length 5 into a matching and a 3-colorable graph
European Journal of Combinatorics | 2014-10-08 | Paper |
| scientific article; zbMATH DE number 6311321 (Why is no real title available?) | 2014-06-30 | Paper |
Improved upper bound for acyclic chromatic index of planar graphs without 4-cycles
Journal of Combinatorial Optimization | 2014-06-24 | Paper |
\((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9
Discrete Mathematics | 2014-05-06 | Paper |
Planar graphs with cycles of length neither 4 nor 7 are \((3,0,0)\)-colorable
Discrete Mathematics | 2014-05-06 | Paper |
Planar graphs with cycles of length neither 4 nor 6 are \((2,0,0)\)-colorable
Information Processing Letters | 2014-04-11 | Paper |
Improper choosability of planar graphs without 4-cycles
SIAM Journal on Discrete Mathematics | 2014-04-10 | Paper |
Improper colorability of planar graphs without prescribed short cycles
Discrete Mathematics | 2014-02-27 | Paper |
Planar graphs without cycles of length 4 or 5 are (3,0,0)-colorable
Discrete Mathematics | 2014-01-23 | Paper |
Plane graphs with maximum degree \(\Delta \geq 8\) are entirely (\(\Delta +3\))-colorable
Journal of Graph Theory | 2013-07-31 | Paper |
\((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle
Information Processing Letters | 2013-04-04 | Paper |
Sufficient conditions for a planar graph to be list edge \(\Delta \)-colorable and list totally \((\Delta +1)\)-colorable
Discrete Mathematics | 2013-03-04 | Paper |
A sufficient condition for a plane graph with maximum degree 6 to be class 1
Discrete Applied Mathematics | 2012-11-22 | Paper |
Acyclic edge coloring of sparse graphs
Discrete Mathematics | 2012-11-20 | Paper |
Linear coloring of sparse graphs
Discrete Applied Mathematics | 2012-05-04 | Paper |
On acyclic edge coloring of planar graphs without intersecting triangles
Discrete Mathematics | 2012-04-13 | Paper |
\((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles
Information Processing Letters | 2012-03-27 | Paper |
On 3-choosability of triangle-free plane graphs
Science China. Mathematics | 2012-01-16 | Paper |
| scientific article; zbMATH DE number 5983740 (Why is no real title available?) | 2011-12-01 | Paper |
A structural theorem for planar graphs with some applications
Discrete Applied Mathematics | 2011-08-10 | Paper |
Decomposing a planar graph with girth at least 8 into a forest and a matching
Discrete Mathematics | 2011-05-10 | Paper |
Planar graphs without cycles of length 4, 7, 8, or 9 are 3-choosable
Discrete Applied Mathematics | 2011-03-09 | Paper |
| Total coloring of plane graphs with maximum degree six and without intersecting triangles and 4-cycles | 2010-11-05 | Paper |
Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable
Discrete Mathematics | 2010-10-11 | Paper |
On 3-colorability of planar graphs without adjacent short cycles
Science China. Mathematics | 2010-06-21 | Paper |
Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
Discrete Applied Mathematics | 2010-04-28 | Paper |
A relaxation of Havel's 3-color problem
Information Processing Letters | 2010-04-19 | Paper |
A sufficient condition for a planar graph to be 3-choosable
Information Processing Letters | 2010-03-24 | Paper |
A note on 3-choosability of planar graphs
Information Processing Letters | 2010-03-24 | Paper |
Planar graphs without cycles of length 4, 5, 8, or 9 are 3-choosable
Discrete Mathematics | 2009-12-15 | Paper |
On the 3-colorability of planar graphs without 4-, 7- and 9-cycles
Discrete Mathematics | 2009-12-10 | Paper |
On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles
Graphs and Combinatorics | 2009-12-09 | Paper |
Total colorings of planar graphs with maximum degree at least 8
Science in China. Series A | 2009-12-07 | Paper |
On the 9-total-colorability of planar graphs with maximum degree 8 and without intersecting triangles
Applied Mathematics Letters | 2009-11-06 | Paper |
| scientific article; zbMATH DE number 5525887 (Why is no real title available?) | 2009-03-06 | Paper |
On the diameter of generalized Kneser graphs
Discrete Mathematics | 2008-09-04 | Paper |
Plane graphs without cycles of length 4, 6, 7 or 8 are 3-colorable
Discrete Mathematics | 2008-07-11 | Paper |
On total chromatic number of planar graphs without 4-cycles
Science in China. Series A | 2007-07-30 | Paper |
Optimization problems of the third edge-connectivity of graphs
Science in China. Series A | 2007-01-24 | Paper |
| scientific article; zbMATH DE number 5079511 (Why is no real title available?) | 2006-12-11 | Paper |
| scientific article; zbMATH DE number 5074046 (Why is no real title available?) | 2006-11-20 | Paper |
Upper bound on the third edge-connectivity of graphs
Science in China. Series A | 2005-11-30 | Paper |
| scientific article; zbMATH DE number 2140713 (Why is no real title available?) | 2005-03-04 | Paper |
Super restricted edge-connectivity of vertex-transitive graphs
Discrete Mathematics | 2005-02-22 | Paper |
A sufficient condition for the equality between the restricted edge-connectivity and the minimum edge-degree of graphs
Applied Mathematics. Series A (Chinese Edition) | 2002-06-30 | Paper |
Super-edge-connectivity properties of graphs with diameter 2
Journal of Shanghai Jiaotong University (Chinese Edition) | 2001-08-30 | Paper |
