A stronger bound for the strong chromatic index (extended abstract)

DOI10.1016/j.endm.2015.06.038zbMath1346.05061OpenAlexW2963456428MaRDI QIDQ322242

Felix Joos, Henning Bruhn

Publication date: 14 October 2016

Full work available at URL: https://doi.org/10.1016/j.endm.2015.06.038

zbMATH Keywords

edge coloringmaximum degreestrong chromatic index

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items

On the strong chromatic index of sparse graphs, On the precise value of the strong chromatic index of a planar graph with a large girth, Strong edge-colorings of sparse graphs with large maximum degree, Strong chromatic index of \(K_4\)-minor free graphs, On strong edge-coloring of graphs with maximum degree 4, Colouring squares of claw-free graphs, Strong incidence coloring of outerplanar graphs, The tight bound for the strong chromatic indices of claw-free subcubic graphs, Upper bounds for the strong chromatic index of Halin graphs, On strong edge-coloring of graphs with maximum degree 5, Strong edge-coloring of subcubic planar graphs, Degenerate matchings and edge colorings, Unnamed Item, Colouring Squares of Claw-free Graphs, Strong chromatic index of subcubic planar multigraphs, Corrigendum to: ``A local epsilon version of Reed's conjecture, Fractional strong chromatic index of bipartite graphs, Induced Matchings in Graphs of Degree at Most 4, Proof of a conjecture on the strong chromatic index of Halin graphs, Strong edge-coloring of pseudo-Halin graphs, Strong edge-coloring of planar graphs, Induced Matchings in Graphs of Bounded Maximum Degree, Recent progress on strong edge-coloring of graphs, Edge-partition and star chromatic index, $t$-Strong Cliques and the Degree-Diameter Problem, Strong edge coloring of Cayley graphs and some product graphs, On strong edge-coloring of claw-free subcubic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
• Induced matchings in bipartite graphs
• The strong chromatic index of a cubic graph is at most 10
• A bound on the strong chromatic index of a graph
• Coloring graphs with sparse neighborhoods
• Concentration of measure and isoperimetric inequalities in product spaces
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• Weighted sums of certain dependent random variables
• Concentration for Independent Permutations
• A Large Deviation Inequality for Functions of Independent, Multi-Way Choices
• Induced matchings in cubic graphs
• Induced Matchings in Subcubic Graphs
• The Distance-t Chromatic Index of Graphs
• Concentration of multivariate polynomials and its applications