The strong chromatic index of (3,)-bipartite graphs
Abstract
A strong edge-coloring of a graph G=(V,E) is a partition of its edge set E into induced matchings. We study bipartite graphs with one part having maximum degree at most 3 and the other part having maximum degree . We show that every such graph has a strong edge-coloring using at most 3 colors. Our result confirms a conjecture of Brualdi and Quinn Massey ~[BQ] for this class of bipartite graphs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.