A bound on the chromatic number of an almost planar graph
type: Item
instance of: scholarly article
title: A bound on the chromatic number of an almost planar graph
zbMATH Open document ID: 1298.05130
published in: Journal of Mathematical Sciences (New York)
publication date: 2014-09-25T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C10
Mathematics Subject Classification ID: 05C62
zbMATH DE Number: 6347740
zbMATH Keywords: graph drawing
zbMATH Keywords: \(k\)-planar graphs
author: Gleb V. Nenashev
MaRDI profile type: Publication
full work available at URL: s10958-014-1693-6
OpenAlex ID: W2027777075
cites work: Every Planar Map is Four Colorable
cites work: Every planar map is four colorable. I: Discharging
cites work: Every planar map is four colorable. II: Reducibility
cites work: Graphs drawn with few crossings per edge
cites work: SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
cites work: The four-colour theorem
DOI: 10.1007/S10958-014-1693-6
Recommended article: A bound on the chromatic number of the square of a planar graph
Recommended article: An upper bound of linear chromatic number of planar graphs
Recommended article: Bounds for the chromatic number of a graph
Recommended article: Planar graphs have bounded nonrepetitive chromatic number
Recommended article: Upper bounds of entire chromatic number of plane graphs
Recommended article: The complete chromatic number of some planar graphs
Recommended article: Some bounds for the \(b\)-chromatic number of a graph
Recommended article: A lower bound for the chromatic number of a graph
Recommended article: The chromatic number of the plane: the bounded case
description: scientific article; zbMATH DE number 6347740