Edge-partition and star chromatic index

DOI10.1016/j.amc.2018.03.079zbMath1427.05092OpenAlexW2802801011WikidataQ129922368 ScholiaQ129922368MaRDI QIDQ2335139

Ying Wang, Wei Fan Wang, Yi Qiao Wang

Publication date: 13 November 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2018.03.079

zbMATH Keywords

planar graphouterplanar graphstrong chromatic indexedge-partitionstar chromatic index

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (12)

Star Edge Coloring of the Cartesian Product of Graphs ⋮ Star edge-coloring of square grids ⋮ Star edge coloring of graphs with Mad(G)< 14/5 ⋮ Local neighbor-distinguishing index of graphs ⋮ List star edge coloring of \(k\)-degenerate graphs ⋮ Star edge-coloring of graphs with maximum degree four ⋮ An upper bound for the choice number of star edge coloring of graphs ⋮ On star edge colorings of bipartite and subcubic graphs ⋮ List star edge-coloring of claw-free subcubic multigraphs ⋮ List star edge coloring of generalized Halin graphs ⋮ COMPUTATION ON THE TOPOLOGICAL INDICES OF HYALURONIC ACID ⋮ On linear 2-arboricity of certain graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A stronger bound for the strong chromatic index (extended abstract)
• A note on the linear 2-arboricity of planar graphs
• Decomposing a planar graph with girth at least 8 into a forest and a matching
• Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers
• A bound on the strong chromatic index of a graph
• Coloring the square of a \(K_{4}\)-minor free graph
• Planar graphs of maximum degree seven are Class I
• Some sufficient conditions for a planar graph of maximum degree six to be Class 1
• Star Edge Coloring of Some Classes of Graphs
• Every planar map is four colorable
• Star Chromatic Index
• Every planar graph with maximum degree 7 is of class 1

This page was built for publication: Edge-partition and star chromatic index