Strong chromatic index of graphs with maximum degree four

zbMath1395.05057arXiv1806.07012MaRDI QIDQ1671652

Mingfang Huang, Gexin Yu, Michael Santana

Publication date: 7 September 2018

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.07012

zbMATH Keywords

induced matchingstrong edge-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items

The maximum size of an edge 2-neighborhood in \(P_5\)-free graphs, List strong edge-coloring of graphs with maximum degree 4, Unnamed Item, The strong chromatic index of graphs with edge weight eight, The strong clique index of a graph with forbidden cycles, Every subcubic multigraph is (1,27) $(1,{2}^{7})$‐packing edge‐colorable, Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth, Strong list-chromatic index of planar graphs with Ore-degree at most seven, List strong edge-colorings of sparse graphs, Strong edge-coloring of 2-degenerate 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, 子立方平面图的$(1,0)$-松弛强边列表染色, On strong edge-coloring of graphs with maximum degree 5, Unnamed Item, List strong edge coloring of planar graphs with maximum degree 4, Star edge-coloring of graphs with maximum degree four, Strong list-chromatic index of subcubic graphs, Proof of a conjecture on the strong chromatic index of Halin graphs, The strong edge-coloring for graphs with small edge weight, Strong cliques in claw-free graphs, Strong chromatic index of \(K_{1, t}\)-free graphs, Recent progress on strong edge-coloring of graphs, Strong edge-colorings of sparse graphs with \(3\Delta-1\) colors, From light edges to strong edge-colouring of 1-planar graphs, $t$-Strong Cliques and the Degree-Diameter Problem, Strong edge coloring of Cayley graphs and some product graphs, On strong edge-coloring of claw-free subcubic graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong edge-colorings for \(k\)-degenerate graphs
• Strong chromatic index of subcubic planar multigraphs
• The strong chromatic index of \((3,\Delta)\)-bipartite graphs
• Strong edge colouring of subcubic graphs
• On induced matchings
• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
• The strong chromatic index of a class of graphs
• The strong chromatic index of a cubic graph is at most 10
• Incidence and strong edge colorings of graphs
• A bound on the strong chromatic index of a graph
• Colouring graphs with sparse neighbourhoods: bounds and applications
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• On strong edge-colouring of subcubic graphs
• A Stronger Bound for the Strong Chromatic Index
• Induced matchings in cubic graphs
• Precise upper bound for the strong edge chromatic number of sparse planar graphs