Total coloring of planar graphs without 6-cycles (Q617651)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	Total coloring of planar graphs without 6-cycles	scientific article

Statements

scholarly article

Total coloring of planar graphs without 6-cycles (English)

Discrete Applied Mathematics

publication date

21 January 2011

zbMATH Keywords

planar graph

cycle

total coloring

total chromatic number

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1016/j.dam.2010.08.025

On the total coloring of planar graphs.

Total colorings of planar graphs with large maximum degree

Total colourings of planar graphs with large girth

Total colorings of planar graphs without small cycles

The total coloring of a multigraph with maximal degree 4

The total chromatic number of any multigraph with maximum degree five is at most seven

List edge and list total colorings of planar graphs without short cycles

On the total coloring of certain graphs

Determining the total colouring number is NP-hard

On total 9-coloring planar graphs of maximum degree seven

On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles

Total colorings of planar graphs with maximum degree at least 8

Total colorings of planar graphs without adjacent triangles

On Total Chromatic Number of a Graph

Total chromatic number of planar graphs with maximum degree ten

A note on total colorings of planar graphs without 4-cycles

Total colourings of graphs

Identifiers

zbMATH Open document ID

Mathematics Subject Classification ID

zbMATH DE Number

10.1016/J.DAM.2010.08.025

Sitelinks

Mathematics(1 entry)

mardi Publication:617651

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q617651&oldid=38417867"