Strong chromatic index of planar graphs with large girth
From MaRDI portal
Publication:472129
DOI10.7151/dmgt.1763zbMath1303.05063OpenAlexW2018699805MaRDI QIDQ472129
Gerard Jennhwa Chang, Arnaud Pêcher, Mickaël Montassier, Andre Raspaud
Publication date: 18 November 2014
Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1763
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Vertex degrees (05C07)
Related Items
Strong edge-coloring for planar graphs with large girth ⋮ On the strong chromatic index of sparse graphs ⋮ Facial \(L(2, 1)\)-edge-labelings of trees ⋮ 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 ⋮ Upper bounds for the strong chromatic index of Halin graphs ⋮ Tree-like distance colouring for planar graphs of sufficient girth ⋮ Odd graph and its applications to the strong edge coloring ⋮ Strong edge-coloring for jellyfish graphs ⋮ Recent progress on strong edge-coloring of graphs ⋮ From light edges to strong edge-colouring of 1-planar graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Problems and results in combinatorial analysis and graph theory
- The strong chromatic index of a cubic graph is at most 10
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- A bound on the strong chromatic index of a graph
- Colorings and girth of oriented planar graphs
- Planar graphs of maximum degree seven are Class I
- Strong edge-coloring of graphs with maximum degree 4 using 22 colors
- Strong edge-colouring and induced matchings
- The strong chromatic index ofC4-free graphs
- Induced matchings in cubic graphs
- Precise upper bound for the strong edge chromatic number of sparse planar graphs
