Total chromatic number of \{square,unichord\}-free graphs
type: Item
instance of: scholarly article
zbMATH Open document ID: 1236.05084
published in: Electronic Notes in Discrete Mathematics
publication date: 2012-05-13T00:00:00Z
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 6033983
zbMATH Keywords: cycle with a unique chord
zbMATH Keywords: decomposition
zbMATH Keywords: recognition
zbMATH Keywords: Petersen graph
zbMATH Keywords: Heawood graph
zbMATH Keywords: edge-colouring
zbMATH Keywords: total-colouring
author: R. C. S. Machado
author: Celina M. H. de Figueiredo
MaRDI profile type: Publication
full work available at URL: j.endm.2010.05.085
OpenAlex ID: W1999082207
cites work: Q3070330
cites work: Edge and total choosability of near-outerplanar graphs
cites work: The total coloring of a multigraph with maximal degree 4
cites work: The total chromatic number of any multigraph with maximum degree five is at most seven
cites work: Total chromatic number of one kind of join graphs
cites work: Total colouring regular bipartite graphs is NP-hard
cites work: A structure theorem for graphs with no cycle with a unique chord and its consequences
cites work: On the total coloring of certain graphs
cites work: Determining the total colouring number is NP-hard
cites work: On Total Chromatic Number of a Graph
cites work: Total chromatic number of planar graphs with maximum degree ten
cites work: The determination of the total chromatic number of series-parallel graphs with \((G) \geq 4\)
cites work: Total 4-choosability of series-parallel graphs
cites work: Total colourings of graphs
cites work: Q3815316
DOI: 10.1016/J.ENDM.2010.05.085
title: Total chromatic number of \{square,unichord\}-free graphs
description: scientific article; zbMATH DE number 6033983