Strong chromatic index of subcubic planar multigraphs
From MaRDI portal
Publication:499491
DOI10.1016/j.ejc.2015.07.002zbMath1321.05123arXiv1507.08959OpenAlexW1652355843MaRDI QIDQ499491
Publication date: 30 September 2015
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.08959
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (23)
Between Proper and Strong Edge-Colorings of Subcubic Graphs ⋮ Strong edge-coloring for planar graphs with large girth ⋮ On the strong chromatic index of sparse graphs ⋮ Strong edge-coloring of cubic bipartite graphs: a counterexample ⋮ Strong chromatic index of graphs with maximum degree four ⋮ Strong edge-colorings of sparse graphs with large maximum degree ⋮ Strong chromatic index of \(K_4\)-minor free graphs ⋮ Between proper and strong edge‐colorings of subcubic graphs ⋮ Every subcubic multigraph is (1,27) $(1,{2}^{7})$‐packing edge‐colorable ⋮ Strong edge colorings of graphs and the covers of Kneser graphs ⋮ The tight bound for the strong chromatic indices of claw-free subcubic graphs ⋮ A note on strong edge-coloring of claw-free cubic graphs ⋮ Proper edge-colorings with a rich neighbor requirement ⋮ Tree-like distance colouring for planar graphs of sufficient girth ⋮ Planar graphs with maximum degree 4 are strongly 19-edge-colorable ⋮ Odd graph and its applications to the strong edge coloring ⋮ Strong list-chromatic index of subcubic graphs ⋮ Proof of a conjecture on the strong chromatic index of Halin graphs ⋮ Strong edge-coloring of pseudo-Halin graphs ⋮ Strong cliques in claw-free graphs ⋮ Strong chromatic index of \(K_{1, t}\)-free 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
- The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs
- A stronger bound for the strong chromatic index (extended abstract)
- Induced matchings in subcubic graphs without short cycles
- 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
- On strong edge-colouring of subcubic graphs
- Induced matchings in cubic graphs
- On Representatives of Subsets
- Induced Matchings in Subcubic Planar Graphs
- Induced Matchings in Subcubic 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: Strong chromatic index of subcubic planar multigraphs
