Hongguo Zhu

From MaRDI portal
Person:2005733



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Injective chromatic index of sparse graphs with maximum degree 6
Advances in Mathematics (Beijing)
2026-03-16Paper
Strong chromatic index of graphs with small girth2025-07-23Paper
2-distance coloring of planar graphs without 4, 6-cycles
Discrete Applied Mathematics
2025-06-30Paper
The 2-distance chromatic number of planar graphs without 3,4,8-cycles
Bulletin of the Iranian Mathematical Society
2024-11-28Paper
Injective-edge-coloring of planar graphs with girth restriction
Discrete Mathematics, Algorithms and Applications
2024-11-13Paper
Strong edge coloring of subquartic graphs2024-09-16Paper
Injective edge chromatic number of sparse graphs
Applied Mathematics and Computation
2024-08-12Paper
2-distance coloring of planar graphs without adjacent 5-cycles
Journal of Combinatorial Optimization
2023-08-02Paper
2-Distance coloring of planar graphs without triangles and intersecting 4-cycles
Discrete Mathematics, Algorithms and Applications
2023-07-14Paper
The \(r\)-dynamic chromatic number of planar graphs without special short cycles
Algorithmic Aspects in Information and Management
2023-07-07Paper
On \(( 2 , r )\)-choosability of planar graphs without short cycles
Applied Mathematics and Computation
2023-04-21Paper
Injective edge coloring of sparse graphs with maximum degree 5
Journal of Combinatorial Optimization
2023-01-17Paper
The \(r\)-dynamic chromatic number of planar graphs without 4-,5-cycles
Journal of Combinatorial Optimization
2023-01-17Paper
Wegner's conjecture on 2-distance coloring for planar graphs
Theoretical Computer Science
2022-07-08Paper
Wegner's conjecture on 2-distance coloring2022-07-01Paper
On \((3, r)\)-choosability of some planar graphs
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
2022-03-21Paper
Coloring graphs without bichromatic cycles or paths
Bulletin of the Malaysian Mathematical Sciences Society. Second Series
2021-08-12Paper
Choosability with union separation of planar graphs without cycles of length 4
Applied Mathematics and Computation
2021-03-16Paper
Choosability with union separation of triangle-free planar graphs
Discrete Mathematics
2020-10-08Paper
Strong edge-coloring of subcubic planar graphs
Discrete Mathematics, Algorithms and Applications
2017-03-07Paper


Research outcomes over time


This page was built for person: Hongguo Zhu