Star edge coloring of some classes of graphs
\v{L}udmila Bezegov\'a, Borut Lu\v{z}ar, Martina, Mockov\v{c}iakov\'a, Roman Sot\'ak, Riste \v{S}krekovski
TL;DR
This paper investigates star edge coloring, establishing tight bounds for trees and subcubic outerplanar graphs, and providing an upper bound for outerplanar graphs, advancing understanding of coloring constraints in specific graph classes.
Contribution
It provides new tight bounds for star edge coloring in trees and subcubic outerplanar graphs, and an upper bound for outerplanar graphs, improving existing theoretical limits.
Findings
Tight upper bounds for trees and subcubic outerplanar graphs.
An upper bound for outerplanar graphs.
Enhanced understanding of star edge coloring constraints.
Abstract
\textit{A star edge coloring} of a graph is a proper edge coloring without bichromatic paths and cycles of length four. In this paper we establish tight upper bounds for trees and subcubic outerplanar graphs, and derive an upper bound for outerplanar graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.