A Stronger Bound for the Strong Chromatic Index

DOI10.1017/S0963548317000244zbMath1378.05047arXiv1504.02583OpenAlexW2738901344MaRDI QIDQ4601050

Henning Bruhn, Felix Joos

Publication date: 19 January 2018

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1504.02583

zbMATH Keywords

total colouringtotal chromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (25)

Strong edge coloring of circle graphs ⋮ Colouring graphs with forbidden bipartite subgraphs ⋮ Colouring graphs with sparse neighbourhoods: bounds and applications ⋮ Strong chromatic index of graphs with maximum degree four ⋮ Unnamed Item ⋮ The strong clique index of a graph with forbidden cycles ⋮ Colorings, transversals, and local sparsity ⋮ Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth ⋮ Graph and hypergraph colouring via nibble methods: a survey ⋮ On the list coloring version of Reed's conjecture ⋮ A proof of the Erdős-Faber-Lovász conjecture ⋮ Strong edge-coloring of 2-degenerate graphs ⋮ Injective edge-coloring of subcubic graphs ⋮ A note on strong edge-coloring of claw-free cubic graphs ⋮ 子立方平面图的$(1,0)$-松弛强边列表染色 ⋮ Hypergraph incidence coloring ⋮ Revisiting semistrong edge‐coloring of graphs ⋮ Star edge-coloring of graphs with maximum degree four ⋮ A local epsilon version of Reed's conjecture ⋮ Strong cliques and forbidden cycles ⋮ (1,0)-Relaxed strong edge list coloring of planar graphs with girth 6 ⋮ Strong list-chromatic index of subcubic graphs ⋮ Strong cliques in claw-free graphs ⋮ Strong chromatic index of \(K_{1, t}\)-free graphs ⋮ Strong edge-colorings of sparse graphs with \(3\Delta-1\) colors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Clique number of the square of a line graph
• 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 total chromatic number
• A bound on the strong chromatic index of a graph
• Coloring graphs with sparse neighborhoods
• Counting cycles and finite dimensional \(L^{p}\) norms
• 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
• Induced Matchings in Graphs of Bounded Maximum Degree
• Concentration for Independent Permutations
• A Large Deviation Inequality for Functions of Independent, Multi-Way Choices
• The strong chromatic index ofC4-free graphs
• Induced matchings in cubic graphs
• On Brooks' Theorem for Sparse Graphs
• Induced Matchings in Subcubic Graphs
• On the Method of Typical Bounded Differences
• The Distance-t Chromatic Index of Graphs
• Induced Matchings in Graphs of Degree at Most 4
• Concentration of multivariate polynomials and its applications

This page was built for publication: A Stronger Bound for the Strong Chromatic Index