The strong chromatic index of $(3,\Delta)$-bipartite graphs
The strong chromatic index of $(3,\Delta)$-bipartite graphs
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 $\Delta$. We show that every such graph has a strong edge-coloring using at most $3 \Delta$ colors. Our result confirms a conjecture of Brualdi and Quinn Massey ~\cite{[BQ]} for this class of bipartite graphs.
Coloring of graphs and hypergraphs, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), bipartite graph, Mathematics - Combinatorics, induced matching, strong edge-coloring
Coloring of graphs and hypergraphs, Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.), bipartite graph, Mathematics - Combinatorics, induced matching, strong edge-coloring
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).0 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!