A note on \(n\)-edge chromatic number
type: Item
instance of: scholarly article
title: A note on \(n\)-edge chromatic number
zbMATH Open document ID: 0902.05032
DOI: 10.1007/BF02883189
author: Liang Sun
author: Zhongfu Zhang
published in: Chinese Science Bulletin
publication date: 1998-12-02T00:00:00Z
review text: All graphs \(G\) appearing in this note are simple. The maximum degree of \(G\) is denoted by \(\Delta(G)\). Let \(n\geq 2\) be an integer. The \(n\)-edge chromatic number \(\chi_n'(G)\) of a simple graph \(G\) is the minimum cardinality of a set of colors with which one can assign colors to the edges of \(G\) such that the edges on a path of length less than or equal to \(n\) receive different colors. The aim of this note is to explore bounds for \(\chi_n'(G)\) and \(\chi_n'(G)+ \chi_n'(\overline G)\).
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 1159081
zbMATH Keywords: chromatic number
zbMATH Keywords: colors
MaRDI profile type: Publication
cites work: Q4517442
cites work: Q3097395
full work available at URL: https://doi.org/10.1007/bf02883189
OpenAlex ID: W2325142030
description: scientific article; zbMATH DE number 1159081