Strong chromatic index of subcubic planar multigraphs
From MaRDI portal
Publication:499491
DOI10.1016/J.EJC.2015.07.002zbMATH Open1321.05123arXiv1507.08959OpenAlexW1652355843MaRDI QIDQ499491FDOQ499491
Authors: Yong-Cai Geng, Sumit K. Garg 
Publication date: 30 September 2015
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Abstract: The strong chromatic index of a multigraph is the minimum such that the edge set can be -colored requiring that each color class induces a matching. We verify a conjecture of Faudree, Gy'{a}rf'{a}s, Schelp and Tuza, showing that every planar multigraph with maximum degree at most 3 has strong chromatic index at most 9, which is sharp.
Full work available at URL: https://arxiv.org/abs/1507.08959
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Induced matchings in subcubic planar graphs
- Induced matchings in subcubic graphs
- A bound on the strong chromatic index of a graph
- On Representatives of Subsets
- Title not available (Why is that?)
- Problems and results in combinatorial analysis and graph theory
- The strong chromatic index of a cubic graph is at most 10
- Induced matchings in cubic graphs
- On induced matchings
- The strong chromatic index of a class of graphs
- A stronger bound for the strong chromatic index (extended abstract)
- Title not available (Why is that?)
- Induced matchings in subcubic graphs without short cycles
- On strong edge-colouring of subcubic graphs
- Strong edge colouring of subcubic graphs
- Title not available (Why is that?)
- Precise upper bound for the strong edge chromatic number of sparse planar graphs
- Strong edge-coloring of planar graphs
Cited In (27)
- A note on strong edge-coloring of claw-free cubic graphs
- Planar graphs with maximum degree 4 are strongly 19-edge-colorable
- Proper edge-colorings with a rich neighbor requirement
- Strong cliques in claw-free graphs
- Every subcubic multigraph is (1,27) $(1,{2}^{7})$‐packing edge‐colorable
- Proof of a conjecture on the strong chromatic index of Halin graphs
- Strong chromatic index and Hadwiger number
- Strong edge-coloring of pseudo-Halin graphs
- On the strong chromatic index of cyclic multigraphs
- Between Proper and Strong Edge-Colorings of Subcubic Graphs
- The strong chromatic index of a cubic graph is at most 10
- Strong edge-coloring of cubic bipartite graphs: a counterexample
- Odd graph and its applications to the strong edge coloring
- Strong chromatic index of \(K_{1, t}\)-free graphs
- From light edges to strong edge-colouring of 1-planar graphs
- Between proper and strong edge‐colorings of subcubic graphs
- Strong chromatic index of \(K_4\)-minor free 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
- Strong edge colorings of graphs and the covers of Kneser graphs
- Strong chromatic index of graphs with maximum degree four
- The tight bound for the strong chromatic indices of claw-free subcubic graphs
- Strong list-chromatic index of subcubic graphs
- Tree-like distance colouring for planar graphs of sufficient girth
- Strong edge-colorings of sparse graphs with large maximum degree
- Strong chromatic index in subset graphs
This page was built for publication: Strong chromatic index of subcubic planar multigraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q499491)
