Strong Edge Coloring of Generalized Petersen Graphs

Strong Edge Coloring of Generalized Petersen Graphs

A strong edge coloring of a graph <i>G</i> is a proper edge coloring such that every color class is an induced matching. In 2018, Yang and Wu proposed a conjecture that every generalized Petersen graph <inline-formula><math display="inline"><semantics><mrow...

Full description

Bibliographic Details
Main Authors: Ming Chen, Lianying Miao, Shan Zhou
Format: Article
Language:English
Published: MDPI AG 2020-08-01
Series:Mathematics
Subjects:
strong edge coloring
generalized Petersen graphs
partition
Online Access:https://www.mdpi.com/2227-7390/8/8/1265

Similar Items

Similar Items