EQUITABLE EDGE CHROMATIC NUMBER OF MYCIELSKIAN OF GRAPHS

DOI10.17654/MS101091887zbMath1381.05024MaRDI QIDQ4975477

J. Veninstine Vivik, G. Girija

Publication date: 7 August 2017

Published in: Far East Journal of Mathematical Sciences (FJMS) (Search for Journal in Brave)

Full work available at URL: http://www.pphmj.com/abstract/10722.htm

zbMATH Keywords

Mycielski graphMycielskianequitable edge chromatic number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Equitable edge coloring on tensor product of graphs ⋮ Equitable edge chromatic number of P_{m}⊗S_{n}⁰ and S_{m}⁰⊗S_{n}⁰

This page was built for publication: EQUITABLE EDGE CHROMATIC NUMBER OF MYCIELSKIAN OF GRAPHS