On the strong chromatic index of sparse graphs
From MaRDI portal
Publication:1658764
zbMath1393.05112arXiv1508.03515MaRDI QIDQ1658764
Luke L. Nelsen, Bernard Lidický, Jennifer White, Stephen G. Hartke, Nathan Graber, Michael Ferrara, Philip Deorsey, Derrick Stolee, Sogol Jahanbekam, Eric C. Sullivan
Publication date: 15 August 2018
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.03515
Related Items (5)
On strong edge-coloring of graphs with maximum degree 4 ⋮ Strong edge colorings of graphs and the covers of Kneser graphs ⋮ Upper bounds for the strong chromatic index of Halin graphs ⋮ Odd graph and its applications to the strong edge coloring ⋮ Recent progress on strong edge-coloring of graphs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A stronger bound for the strong chromatic index (extended abstract)
- Strong chromatic index of planar graphs with large girth
- Strong chromatic index of subcubic planar multigraphs
- An introduction to the discharging method via graph coloring
- Strong edge colouring of subcubic graphs
- On induced matchings
- The strong chromatic index of a class of graphs
- Problems and results in combinatorial analysis and graph theory
- The strong chromatic index of a cubic graph is at most 10
- A bound on the strong chromatic index of a graph
- Colorings and girth of oriented planar graphs
- The Magma algebra system. I: The user language
- The incidence coloring conjecture for graphs of maximum degree 3
- Odd graph and its applications to the strong edge coloring
- On strong edge-colouring of subcubic graphs
- Combinatorial Nullstellensatz
- A General Upper Bound on the List Chromatic Number of Locally Sparse Graphs
- Precise upper bound for the strong edge chromatic number of sparse planar graphs
- Strong edge-coloring of planar graphs
This page was built for publication: On the strong chromatic index of sparse graphs
