Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\)
type: Item
instance of: scholarly article
title: Total colorings of graphs of order \(2n\) having maximum degree \(2n-2\)
zbMATH Open document ID: 0771.05034
DOI: 10.1007/BF02350630
author: Bor-Liang Chen
author: Hung-Lin Fu
published in: Graphs and Combinatorics
publication date: 1993-01-16T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 89195
zbMATH Keywords: total colorings
zbMATH Keywords: chromatic number
zbMATH Keywords: maximum degree
MaRDI profile type: Publication
cites work: The Colour Numbers of Complete Graphs
cites work: Q3097395
cites work: Q3832589
cites work: A total-chromatic number analogue of Plantholt's theorem
cites work: The total coloring of a multigraph with maximal degree 4
cites work: On the total coloring of certain graphs
cites work: Total Colourings of Graphs
full work available at URL: https://doi.org/10.1007/bf02350630
OpenAlex ID: W2000598303
description: scientific article; zbMATH DE number 89195