The strong edge-coloring for graphs with small edge weight

DOI10.1016/J.DISC.2019.111779MaRDI QIDQ2297732zbMATH OpenOpenAlexFDO

Authors Lily Chen, Mingfang Huang, Gexin Yu, Xiangqian Zhou

Publication date 20 February 2020

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2019.111779

zbMATH Keywords

edge weightstrong edge-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22)

Recommendations

• The strong chromatic index of graphs with edge weight eight
• Recent progress on strong edge-coloring of graphs
• Strong edge colorings of graphs
• Injective edge coloring for graphs with small edge weight
• Strong edge-coloring of planar graphs

Cites work

• A note on the strong chromatic index of bipartite graphs
• scientific article; zbMATH DE number 3851125 (Why is no real title available?)
• scientific article; zbMATH DE number 4187830 (Why is no real title available?)
• Incidence and strong edge colorings of graphs
• Induced matchings in cubic graphs
• On induced matchings
• Strong chromatic index of graphs with maximum degree four
• The strong chromatic index of \((3,\Delta)\)-bipartite graphs
• The strong chromatic index of a class of graphs
• The strong chromatic index of a cubic graph is at most 10

Cited in

(12)

• Proof of a conjecture on the strong chromatic index of Halin graphs
• On S-packing edge-colorings of graphs with small edge weight
• Injective edge-coloring of graphs with small weight
• The strong chromatic index of graphs with edge weight eight
• Semistrong edge coloring of graphs
• Recent progress on strong edge-coloring of graphs
• The cost chromatic number and hypergraph parameters
• Strong list-chromatic index of planar graphs with Ore-degree at most seven
• List strong edge-colorings of sparse graphs
• Strong edge-coloring of graphs with maximum edge weight seven
• Strong chromatic index of claw-free graphs with edge weight seven
• Planar graphs with Ore-degree at most seven is strongly 13-edge-colorable

This page was built for publication: The strong edge-coloring for graphs with small edge weight

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2297732)