| Publication | Date of Publication | Type |
|---|
(2,1)-total labelling of planar graphs with large maximum degree
Journal of Discrete Mathematical Sciences and Cryptography | 2022-04-19 | Paper |
| scientific article; zbMATH DE number 7491835 (Why is no real title available?) | 2022-03-17 | Paper |
| scientific article; zbMATH DE number 7491923 (Why is no real title available?) | 2022-03-17 | Paper |
| scientific article; zbMATH DE number 7492030 (Why is no real title available?) | 2022-03-17 | Paper |
| scientific article; zbMATH DE number 7492071 (Why is no real title available?) | 2022-03-17 | Paper |
1-平面图的结构性质及其在无圈边染色上的应用
SCIENTIA SINICA Mathematica | 2021-12-17 | Paper |
Graphs of \(f\)-class 1
Discrete Applied Mathematics | 2018-09-25 | Paper |
Rainbow matchings in properly colored bipartite graphs
Open Journal of Discrete Mathematics | 2017-09-01 | Paper |
On total colorings of 1-planar graphs
Journal of Combinatorial Optimization | 2015-07-01 | Paper |
On the lightness of chordal 4-cycle in 1-planar graphs with high minimum degree
Ars Mathematica Contemporanea | 2015-01-26 | Paper |
| scientific article; zbMATH DE number 6383859 (Why is no real title available?) | 2015-01-06 | Paper |
Fractional \(f\)-edge cover chromatic index of graphs
Graphs and Combinatorics | 2014-06-16 | Paper |
| New upper bounds for the heights of some light subgraphs in 1-planar graphs with high minimum degree | 2014-03-25 | Paper |
Long properly colored cycles in edge colored complete graphs
Discrete Mathematics | 2014-03-20 | Paper |
Every toroidal graph is acyclically 8-choosable
Acta Mathematica Sinica, English Series | 2014-03-18 | Paper |
| Binding number, minimum degree for connected (g, f + 1)-factors in graphs | 2014-03-12 | Paper |
| List edge and list total colorings of planar graphs without non-induced 7-cycles | 2014-02-14 | Paper |
A note on rainbow matchings
Discrete Mathematics, Algorithms and Applications | 2014-01-28 | Paper |
Total coloring of embedded graphs with maximum degree at least seven
Theoretical Computer Science | 2014-01-13 | Paper |
Properties of Hamilton cycles of circuit graphs of matroids
Frontiers of Mathematics in China | 2013-11-18 | Paper |
Group edge choosability of planar graphs without adjacent short cycles
Acta Mathematica Sinica, English Series | 2013-11-15 | Paper |
On (p,1)-total labelling of plane graphs with independent crossings
Filomat | 2013-10-30 | Paper |
Edge disjoint Hamilton cycles in intersection graphs of bases of matroids
Utilitas Mathematica | 2013-09-26 | Paper |
On edge colorings of 1-toroidal graphs
Acta Mathematica Sinica, English Series | 2013-07-16 | Paper |
On f-edge covered critical graphs
JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing | 2013-07-12 | Paper |
| Hamilton cycles in matroid base graphs | 2013-06-20 | Paper |
\(k\)-forested choosability of graphs with bounded maximum average degree
Bulletin of the Iranian Mathematical Society | 2013-06-12 | Paper |
| Toughness and \([a,b]\)-factors in graphs. | 2013-06-10 | Paper |
Nowhere-zero 3-flows in matroid base graph
Frontiers of Mathematics in China | 2013-04-08 | Paper |
On edge covering colorings of graphs
Information Processing Letters | 2013-04-04 | Paper |
A note on relaxed equitable coloring of graphs
Information Processing Letters | 2013-04-04 | Paper |
| On edge colorings of 1-planar graphs without chordal 5-cycles. | 2013-03-21 | Paper |
List total colorings of planar graphs without triangles at small distance
Acta Mathematica Sinica, English Series | 2013-03-18 | Paper |
The structure of plane graphs with independent crossings and its applications to coloring problems
Central European Journal of Mathematics | 2013-02-18 | Paper |
Circular coloring of planar digraphs
Graphs and Combinatorics | 2013-01-03 | Paper |
A note on heterochromatic \(C_4\) in edge-colored triangle-free graphs
Graphs and Combinatorics | 2013-01-03 | Paper |
Acyclic edge coloring of planar graphs without small cycles
Graphs and Combinatorics | 2012-12-27 | Paper |
List edge and list total coloring of 1-planar graphs
Frontiers of Mathematics in China | 2012-12-06 | Paper |
Light subgraphs in the family of 1-planar graphs with high minimum degree
Acta Mathematica Sinica, English Series | 2012-11-07 | Paper |
New upper bounds on linear coloring of planar graphs
Acta Mathematica Sinica, English Series | 2012-11-07 | Paper |
Existence of rainbow matchings in properly edge-colored graphs
Frontiers of Mathematics in China | 2012-11-07 | Paper |
A BOUND ON THE BONDAGE NUMBER OF TOROIDAL GRAPHS
Discrete Mathematics, Algorithms and Applications | 2012-10-15 | Paper |
| Edge-choosability of planar graphs without chordal 7-cycles. | 2012-10-12 | Paper |
| On edge cover coloring of join graphs. | 2012-10-12 | Paper |
Circular choosability of planar graphs with large girth.
Ars Combinatoria | 2012-10-08 | Paper |
Edge covering pseudo-outerplanar graphs with forests
Discrete Mathematics | 2012-09-12 | Paper |
On \(r\)-acyclic edge colorings of planar graphs
Discrete Applied Mathematics | 2012-08-10 | Paper |
(1,)-embedded graphs and the acyclic edge choosability
Bulletin of the Korean Mathematical Society | 2012-06-08 | Paper |
k-forested coloring of sparse graphs
Journal of Shandong University. Natural Science | 2012-06-01 | Paper |
List (d,1)-total labelling of graphs embedded in surfaces
Operations Research Transactions | 2012-06-01 | Paper |
On the linear arboricity of 1-planar graphs
Operations Research Transactions | 2012-06-01 | Paper |
On edge colorings of 1-planar graphs without adjacent triangles
Information Processing Letters | 2012-05-04 | Paper |
List edge and list total colorings of planar graphs without 6-cycles with chord
Bulletin of the Korean Mathematical Society | 2012-04-13 | Paper |
Toughness and \([a, b]\)-factors with inclusion\(/\)exclusion properties
Science China. Mathematics | 2012-03-29 | Paper |
\(k\)-forested choosability of planar graphs and sparse graphs
Discrete Mathematics | 2012-03-16 | Paper |
| On fractional (g,f,n)-critical graphs. | 2012-02-20 | Paper |
| A new sufficient condition for graphs of f-class 1. | 2012-02-20 | Paper |
On (p,1)-total labelling of 1-planar graphs
Central European Journal of Mathematics | 2011-12-12 | Paper |
| Total coloring of pseudo-outerplanar graphs | 2011-08-25 | Paper |
| On f-edge cover coloring of regular graphs | 2011-08-16 | Paper |
| Bondage number of planar graphs without small cycles | 2011-08-16 | Paper |
Circular vertex arboricity
Discrete Applied Mathematics | 2011-08-10 | Paper |
Edge Coloring of Triangle-Free 1-Planar Graphs
(available as arXiv preprint) | 2011-07-19 | Paper |
| scientific article; zbMATH DE number 5914884 (Why is no real title available?) | 2011-06-29 | Paper |
| scientific article; zbMATH DE number 5914945 (Why is no real title available?) | 2011-06-29 | Paper |
| A neighborhood condition for graphs to have (g,f)-factors. | 2011-06-29 | Paper |
On \(f\)-edge cover coloring of nearly bipartite graphs
Bulletin of the Malaysian Mathematical Sciences Society. Second Series | 2011-05-23 | Paper |
On \(f\)-edge cover coloring of nearly bipartite graphs
Bulletin of the Malaysian Mathematical Sciences Society. Second Series | 2011-05-23 | Paper |
Improved bounds for acyclic chromatic index of planar graphs
Discrete Applied Mathematics | 2011-05-17 | Paper |
The method of coloring in graphs and its application
Journal of Systems Science and Complexity | 2011-04-05 | Paper |
k-forested coloring of planar graphs with large girth
Proceedings of the Japan Academy. Series A | 2011-03-29 | Paper |
Equitable edge-colorings of simple graphs
Journal of Graph Theory | 2011-03-21 | Paper |
The existence of even regular factors of regular graphs on the number of cut edges
Acta Mathematica Sinica, English Series | 2011-03-02 | Paper |
Total coloring of embedded graphs of maximum degree at least ten
Science China. Mathematics | 2011-02-25 | Paper |
Neighbor set for the existence of (g,f,n)-critical graphs
Bulletin of the Malaysian Mathematical Sciences Society. Second Series | 2011-02-10 | Paper |
Neighbor set for the existence of (g,f,n)-critical graphs
Bulletin of the Malaysian Mathematical Sciences Society. Second Series | 2011-02-10 | Paper |
A note on \([r, s, c, t]\)-colorings of graphs
Bulletin of the Malaysian Mathematical Sciences Society. Second Series | 2011-02-10 | Paper |
A note on \([r, s, c, t]\)-colorings of graphs
Bulletin of the Malaysian Mathematical Sciences Society. Second Series | 2011-02-10 | Paper |
| scientific article; zbMATH DE number 5844210 (Why is no real title available?) | 2011-02-02 | Paper |
| Strongly pan-factorial property in cages | 2011-02-02 | Paper |
| Stability number and \(f\)-factor in \(K_{1,n}\)-free graphs | 2011-02-02 | Paper |
Total coloring of planar graphs without 6-cycles
Discrete Applied Mathematics | 2011-01-21 | Paper |
Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles
International Journal of Computer Mathematics | 2011-01-20 | Paper |
On the fractional f-chromatic index of a graph
International Journal of Computer Mathematics | 2011-01-20 | Paper |
\([r, s, t; f]\)-coloring of graphs
Journal of the Korean Mathematical Society | 2011-01-12 | Paper |
A new result on \([k,k + 1]\)-factors containing given Hamiltonian cycles
Combinatorial Optimization and Applications | 2011-01-10 | Paper |
Vertex-distinguishing edge colorings of graphs with degree sum conditions
Graphs and Combinatorics | 2010-12-03 | Paper |
Acyclic edge chromatic number of outerplanar graphs
Journal of Graph Theory | 2010-11-10 | Paper |
Degree conditions of fractional ID-k-factor-critical graphs
Bulletin of the Malaysian Mathematical Sciences Society. Second Series | 2010-10-14 | Paper |
The connectivity and minimum degree of circuit graphs of matroids
Acta Mathematica Sinica, English Series | 2010-09-21 | Paper |
Path embedding in faulty hypercubes
Applied Mathematics and Computation | 2010-09-01 | Paper |
A note on ``The super connectivity of augmented cubes''
Information Processing Letters | 2010-08-16 | Paper |
| scientific article; zbMATH DE number 5732605 (Why is no real title available?) | 2010-07-08 | Paper |
Edge-choosability of planar graphs without non-induced 5-cycles
Information Processing Letters | 2010-06-16 | Paper |
On the adjacent vertex distinguishing edge colourings of graphs
International Journal of Computer Mathematics | 2010-06-11 | Paper |
List edge and list total colorings of planar graphs without short cycles
Information Processing Letters | 2010-06-09 | Paper |
The super connectivity of augmented cubes
Information Processing Letters | 2010-04-19 | Paper |
On super \(f\)-edge cover-coloring in multigraphs
Discrete Mathematics, Algorithms and Applications | 2010-03-11 | Paper |
Total colorings and list total colorings of planar graphs without intersecting 4-cycles
Discrete Mathematics | 2009-12-15 | Paper |
Orthogonal factorizations of digraphs
Frontiers of Mathematics in China | 2009-12-14 | Paper |
Acyclic edge colorings of planar graphs and series parallel graphs
Science in China. Series A | 2009-12-07 | Paper |
| On super f-edge cover-coloring of multigraphs | 2009-11-11 | Paper |
Acyclic edge coloring of planar graphs with large girth
Theoretical Computer Science | 2009-11-06 | Paper |
