Strong chromatic index of planar graphs with large girth
DOI10.7151/DMGT.1763zbMATH Open1303.05063OpenAlexW2018699805MaRDI QIDQ472129FDOQ472129
Authors: Gerard Jennhwa Chang, Arnaud Pêcher, Mickaël Montassier, André 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
Recommendations
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)
Cites Work
- 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
- Title not available (Why is that?)
- Colorings and girth of oriented planar graphs
- Problems and results in combinatorial analysis and graph theory
- Planar graphs of maximum degree seven are Class I
- Title not available (Why is that?)
- The strong chromatic index of a cubic graph is at most 10
- Strong edge-coloring of graphs with maximum degree 4 using 22 colors
- Induced matchings in cubic graphs
- Strong edge-colouring and induced matchings
- Title not available (Why is that?)
- The strong chromatic index ofC4-free graphs
- Title not available (Why is that?)
- Precise upper bound for the strong edge chromatic number of sparse planar graphs
Cited In (13)
- On the precise value of the strong chromatic index of a planar graph with a large girth
- Facial \(L(2, 1)\)-edge-labelings of trees
- Acyclic chromatic indices of planar graphs with large girth
- Odd graph and its applications to the strong edge coloring
- From light edges to strong edge-colouring of 1-planar graphs
- Upper bounds for the strong chromatic index of Halin graphs
- Strong edge-coloring for jellyfish graphs
- Recent progress on strong edge-coloring of graphs
- Strong edge-coloring for planar graphs with large girth
- On the strong chromatic index of sparse graphs
- On 4-edge colouring planar bridgeless graphs with large girth
- Tree-like distance colouring for planar graphs of sufficient girth
- Strong edge-colorings of sparse graphs with large maximum degree
This page was built for publication: Strong chromatic index of planar graphs with large girth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q472129)
