Hits :

First Author : Yiqiao Wang

Affiliation of Author(s): 数理与信息工程学院

Date of Publication : 2018-01-01

Document Type : 期刊

Journal : Information Processing Letters

Volume: Vol.129

Page Number : 53-56

ISSN : 0020-0190

Translation or Not : no

Key Words : K 4-minor free graph;Strong edge colouring;Strong chromatic index;Combinatorial problems

Abstract : The strong chromatic index χ s ′ ( G ) of a graph G is the smallest integer k such that G has a proper edge k -colouring with the condition that any two edges at distance at most 2 receive distinct colours. In this paper, we prove that if G is a K 4 -mino