Odd graph and its applications to the strong edge coloring

DOI10.1016/J.AMC.2017.11.057zbMath1428.05120arXiv1412.8358OpenAlexW2768840597MaRDI QIDQ2279245

Tao Wang, Xiaodan Zhao

Publication date: 12 December 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

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

zbMATH Keywords

planar graphsstrong chromatic indexmaximum average degreestrong edge coloringodd graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

On the strong chromatic index of sparse graphs ⋮ On the precise value of the strong chromatic index of a planar graph with a large girth ⋮ Recent progress on strong edge-coloring of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strong chromatic index of planar graphs with large girth
• Strong chromatic index of subcubic planar multigraphs
• An introduction to the discharging method via graph coloring
• 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
• Colorings and girth of oriented planar graphs
• On the strong chromatic index of sparse graphs
• Strong edge-coloring of graphs with maximum degree 4 using 22 colors
• Induced matchings in cubic graphs
• Precise upper bound for the strong edge chromatic number of sparse planar graphs

This page was built for publication: Odd graph and its applications to the strong edge coloring