| Publication | Date of Publication | Type |
|---|
The 2-distance chromatic number of planar graphs without 3,4,8-cycles
Bulletin of the Iranian Mathematical Society | 2024-11-28 | Paper |
Strong edge coloring of subquartic graphs
| 2024-09-16 | Paper |
Injective edge chromatic number of sparse graphs
Applied Mathematics and Computation | 2024-08-12 | Paper |
Channel assignment with \(r\)-dynamic coloring
Algorithmic Aspects in Information and Management | 2023-10-16 | Paper |
Injective edge coloring of power graphs and necklaces
Algorithmic Aspects in Information and Management | 2023-07-07 | Paper |
Injective edge coloring of graphs with maximum degree 5
Discrete Applied Mathematics | 2023-05-11 | Paper |
Injective edge coloring of sparse graphs with maximum degree 5
Journal of Combinatorial Optimization | 2023-01-17 | Paper |
The \(r\)-dynamic chromatic number of planar graphs without 4-,5-cycles
Journal of Combinatorial Optimization | 2023-01-17 | Paper |
Wegner's conjecture on 2-distance coloring for planar graphs
Theoretical Computer Science | 2022-07-08 | Paper |
Wegner's conjecture on 2-distance coloring
| 2022-07-01 | Paper |
Injective edge coloring of planar graphs
| 2021-04-26 | Paper |
Injective coloring of planar graphs
Theoretical Computer Science | 2021-01-25 | Paper |
List \(r\)-dynamic coloring of sparse graphs
Theoretical Computer Science | 2020-04-01 | Paper |
An online algorithm for hierarchical scheduling on two identical machines with rejection
| 2019-09-20 | Paper |
Optimal \(r\)-dynamic coloring of sparse graphs
Journal of Combinatorial Optimization | 2019-06-25 | Paper |
List \(r\)-dynamic coloring of graphs with small maximum average degree
Discrete Applied Mathematics | 2019-03-22 | Paper |
Optimal channel assignment and \(L(p,1)\)-labeling
Journal of Global Optimization | 2018-12-07 | Paper |
Minimum 2-distance coloring of planar graphs and channel assignment
Journal of Combinatorial Optimization | 2018-07-26 | Paper |
Blocking rumor by cut
Journal of Combinatorial Optimization | 2018-07-20 | Paper |
scientific article; zbMATH DE number 6873968 (Why is no real title available?)
| 2018-05-25 | Paper |
Upper bounds for adjacent vertex-distinguishing edge coloring
Journal of Combinatorial Optimization | 2018-03-01 | Paper |
Equitable list-coloring for \(C_{5}\)-free plane graphs without adjacent triangles
Graphs and Combinatorics | 2015-05-22 | Paper |
Global solutions for a one-dimensional problem in conducting fluids
Communications in Nonlinear Science and Numerical Simulation | 2013-10-31 | Paper |
The inviscid limit behavior for smooth solutions of the Boussinesq system
Abstract and Applied Analysis | 2013-09-19 | Paper |
Equitable and equitable list colorings of graphs
Theoretical Computer Science | 2010-11-11 | Paper |
Equitable list coloring of planar graphs without 3 and 4 cycles
| 2010-11-05 | Paper |
On the equitable total chromatic number of \(P_n\vee K_{m,n}\)
| 2009-03-06 | Paper |
Equitable list colorings of planar graphs without short cycles
Theoretical Computer Science | 2008-11-18 | Paper |
Equitable list coloring of planar graphs without 4-and 7-cycles
| 2008-08-06 | Paper |
