Star Chromatic Index of 1-Planar Graphs
نویسندگان
چکیده
Many symmetric properties are well-explored in graph theory, especially coloring, such as graphs defined by the automorphism groups, drawing of planar graphs, and functions which used to count number specific colorings a graph. This paper is devoted studying star edge coloring 1-planar graphs. The chromatic index χst′(G) G smallest k for edges can be colored using colors so that no two adjacent get same color bichromatic paths or cycles length four produced. A called if it drawn plane each crosses at most one other edge. In this paper, we prove every satisfies χst′(G)≤7.75Δ+166; moreover χst′(G)≤⌊1.5Δ⌋+500 contains 4-cycles, χst′(G)≤2.75Δ+116 3-connected, optimal, NIC-planar.
منابع مشابه
Acyclic chromatic index of triangle-free 1-planar graphs
An acyclic edge coloring of a graph G is a proper edge coloring such that every cycle is colored with at least three colors. The acyclic chromatic index χa(G) of a graph G is the least number of colors in an acyclic edge coloring of G. It was conjectured that χa(G) ≤ ∆(G) + 2 for any simple graph G with maximum degree ∆(G). A graph is 1-planar if it can be drawn on the plane such that every edg...
متن کاملFurther result on acyclic chromatic index of planar graphs
An acyclic edge coloring of a graph G is a proper edge coloring such that every cycle is colored with at least three colors. The acyclic chromatic index χa(G) of a graph G is the least number of colors in an acyclic edge coloring of G. It was conjectured that χa(G) ≤ ∆(G) + 2 for any simple graph G with maximum degree ∆(G). In this paper, we prove that every planar graph G admits an acyclic edg...
متن کاملAn improved bound on acyclic chromatic index of planar graphs
A proper edge coloring of a graph G is called acyclic if there is no bichromatic cycle in G. The acyclic chromatic index of G, denoted by χ′a(G), is the least number of colors k such that G has an acyclic edge k-coloring. Basavaraju et al. [Acyclic edgecoloring of planar graphs, SIAM J. Discrete Math. 25 (2) (2011), 463–478] showed that χ′a(G) ≤ ∆(G) + 12 for planar graphs G with maximum degree...
متن کاملStrong chromatic index of planar graphs with large girth
Let ∆ ≥ 4 be an integer. In this note, we prove that every planar graph with maximum degree ∆ and girth at least 10∆+46 is strong (2∆−1)-edgecolorable, that is best possible (in terms of number of colors) as soon as G contains two adjacent vertices of degree ∆. This improves [6] when ∆ ≥ 6.
متن کاملStar Chromatic Index
The star chromatic index χs(G) of a graph G is the minimum number of colors needed to properly color the edges of the graph so that no path or cycle of length four is bi-colored. We obtain a near-linear upper bound in terms of the maximum degree ∆ = ∆(G). Our best lower bound on χs in terms of ∆ is 2∆(1 + o(1)) valid for complete graphs. We also consider the special case of cubic graphs, for wh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2022
ISSN: ['0865-4824', '2226-1877']
DOI: https://doi.org/10.3390/sym14061177