Minimum feedback vertex set and acyclic coloring
Information Processing Letters
Planar graphs with maximum degree 8 and without adjacent triangles are 9-totally-colorable
Discrete Applied Mathematics
A graph coloring based service discovery in ad hoc networks
Proceedings of the 3rd workshop on Agent-oriented software engineering challenges for ubiquitous and pervasive computing
A strict strong coloring of trees
Information Processing Letters
Information Processing Letters
On the total choosability of planar graphs and of sparse graphs
Information Processing Letters
Note: Total coloring of planar graphs without 6-cycles
Discrete Applied Mathematics
Information Processing Letters
Acyclically 3-colorable planar graphs
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Total colorings of planar graphs without intersecting 5-cycles
Discrete Applied Mathematics
A Generalized Graph Strict Strong Coloring Algorithm
International Journal of Applied Metaheuristic Computing
L(2,1)-labelings of the edge-path-replacement of a graph
Journal of Combinatorial Optimization
L(d,1)-labelings of the edge-path-replacement of a graph
Journal of Combinatorial Optimization
Hi-index | 0.00 |