Publications
Sort:
Open Access Research Article Issue
Injective coloring of planar graphs with girth 5
AIMS Mathematics 2023, 8(7): 17081-17090
Published: 15 July 2023
Abstract PDF (305.7 KB) Collect
Downloads:6

A k-injective-coloring of a graph G is a mapping c : V ( G ) → { 1 , 2 , ⋯ , k } such that c ( u ) ≠ c ( v ) for any two vertices u and v if u and v have a common vertex. The injective chromatic number of G, denoted by χ i ( G ) , is the least k such that G has an injective k-coloring. In this paper, we prove that for planar graph G with g ( G ) ≥ 5, Δ ( G ) ≥ 20 and without adjacent 5-cycles, χ i ( G ) ≤ Δ ( G ) + 2.

Open Access Research Article Issue
Acyclic edge coloring of planar graphs
AIMS Mathematics 2022, 7(6): 10828-10841
Published: 15 June 2022
Abstract PDF (1.1 MB) Collect
Downloads:9

An acyclic edge coloring of a graph G is a proper edge coloring such that no bichromatic cycles are produced. The acyclic chromatic index of G, denoted by χ a ′ ( G ), is the smallest integer k such that G is acyclically edge k-colorable. In this paper, we consider the planar graphs without 3-cycles and intersecting 4-cycles, and prove that χ a ′ ( G ) ≤ Δ ( G ) + 1 if Δ ( G ) ≥ 8.

Open Access Research Article Issue
On the list injective coloring of planar graphs without a 4 − -cycle intersecting with a 5 − -cycle
AIMS Mathematics 2025, 10(1): 1814-1825
Published: 15 January 2025
Abstract PDF (1.4 MB) Collect
Downloads:5

An injective coloring of a graph G is a vertex coloring such that a pair of vertices obtain distinct colors if there is a path of length two between them. It is proved in this paper that χ i l ( G ) ≤ Δ + 4 if Δ ≥ 12 when G does not have a 4 − -cycle intersecting with a 5 − -cycle. Our result improves a previous result of Cai et al. in 2023, who showed that χ i l ( G ) ≤ Δ + 4 when Δ ≥ 12 and G has disjoint 5 − -cycles.

Total 3