Star edge-coloring of graphs with maximum degree four

DOI10.1016/j.amc.2018.08.035zbMath1428.05121OpenAlexW2890158719MaRDI QIDQ2007679

Ying Wang, Wei Fan Wang, Yi Qiao Wang

Publication date: 22 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.08.035

zbMATH Keywords

maximum degreeedge-partitionstar chromatic indexstar edge-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (7)

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 ⋮ 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

Cites Work

• A bound on the strong chromatic index of a graph
• List star edge-coloring of subcubic graphs
• Strong chromatic index of graphs with maximum degree four
• Star 5-edge-colorings of subcubic multigraphs
• List star edge coloring of sparse graphs
• List star chromatic index of sparse graphs
• Edge-partition and star chromatic index
• On Hamiltonian bipartite graphs
• Star Edge Coloring of Some Classes of Graphs
• Star chromatic index of subcubic multigraphs
• A Stronger Bound for the Strong Chromatic Index
• Star Chromatic Index
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Star edge-coloring of graphs with maximum degree four