The Distance-t Chromatic Index of Graphs

DOI10.1017/S0963548313000473zbMath1314.05069arXiv1205.4171MaRDI QIDQ5414148

Tomáš Kaiser, Ross J. Kang

Publication date: 2 May 2014

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

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

zbMATH Keywords

Molloy and Reed's bound on the strong chromatic index

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)

Related Items

A stronger bound for the strong chromatic index (extended abstract) ⋮ Maximizing Line Subgraphs of Diameter at Most t ⋮ Distance colouring without one cycle length ⋮ A Stronger Bound for the Strong Chromatic Index ⋮ Distance Colouring Without One Cycle Length ⋮ Coloring Powers and Girth ⋮ $t$-Strong Cliques and the Degree-Diameter Problem

Cites Work

• Distance edge-colourings and matchings
• Induced matchings in bipartite graphs
• A bound on the strong chromatic index of a graph
• Coloring graphs with sparse neighborhoods
• The nonexistence of certain generalized polygons
• Graph Theory and Probability
• The strong chromatic index ofC4-free graphs