| Publication | Date of Publication | Type |
|---|
CLBA: a Coulomb's law based algorithm for community detection in directed networks
Physica A | 2024-09-19 | Paper |
Second neighborhood via probabilistic argument
Discrete Applied Mathematics | 2024-05-06 | Paper |
Majority choosability of 1-planar digraph
Czechoslovak Mathematical Journal | 2023-08-17 | Paper |
The adjacent vertex distinguishing edge choosability of planar graphs with maximum degree at least 11
Discrete Applied Mathematics | 2022-03-28 | Paper |
scientific article; zbMATH DE number 7478554 (Why is no real title available?)
| 2022-02-22 | Paper |
Neighbor sum distinguishing index of sparse graphs
Acta Mathematica Sinica, English Series | 2020-09-07 | Paper |
Tetravalent half-arc-transitive graphs of order \(8p\)
Journal of Algebraic Combinatorics | 2020-03-06 | Paper |
Improved upper bound for acyclic chromatic number of graphs.
| 2019-12-18 | Paper |
Neighbor sum distinguishing colorings of graphs with maximum average degree less than \(\frac{37} {12}\)
Acta Mathematica Sinica, English Series | 2018-02-13 | Paper |
Neighbor sum distinguishing total choosability of planar graphs without adjacent triangles
Theoretical Computer Science | 2017-01-09 | Paper |
A proper total coloring distinguishing adjacent vertices by sums of planar graphs without intersecting triangles
Journal of Combinatorial Optimization | 2016-08-31 | Paper |
Neighbor sums distinguishing total colorings of planar graphs without short cycles
Utilitas Mathematica | 2016-06-10 | Paper |
Neighbor sum distinguishing total choosability of planar graphs without 4-cycles
Discrete Applied Mathematics | 2016-05-02 | Paper |
Tetravalent half-arc-transitive graphs of order a product of three primes
Discrete Mathematics | 2016-04-07 | Paper |
Neighbor sum distinguishing total colorings of triangle free planar graphs
Acta Mathematica Sinica, English Series | 2015-07-23 | Paper |
Neighbor sum distinguishing index of planar graphs
Discrete Mathematics | 2014-08-14 | Paper |
A note on edge-choosability of planar graphs without intersecting 4-cycles
Journal of Applied Mathematics and Computing | 2011-06-22 | Paper |
scientific article; zbMATH DE number 5844210 (Why is no real title available?)
| 2011-02-02 | Paper |
Edge colourings of embedded graphs without 4-cycles or chordal-4-cycles
International Journal of Computer Mathematics | 2011-01-20 | Paper |
Some results on fractional edge coloring of graphs.
| 2009-05-06 | Paper |
The construction of edge covered critical graphs
| 2008-08-06 | Paper |
\(L(p,q)\)-labelling of planar graphs with high maximum degree
| 2008-04-04 | Paper |
Some properties on \(f\)-edge covered critical graphs
Journal of Applied Mathematics and Computing | 2007-10-22 | Paper |
Edge covering coloring of nearly bipartite graphs
Journal of Applied Mathematics and Computing | 2006-12-04 | Paper |
