A bound on the chromatic number of an almost planar graph

DOI10.1007/S10958-014-1693-6zbMATH Open1298.05130OpenAlexW2027777075MaRDI QIDQ744556FDOQ744556

Authors: Gleb V. Nenashev 

Publication date: 25 September 2014

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-014-1693-6

Recommendations

• A bound on the chromatic number of the square of a planar graph
• An upper bound of linear chromatic number of planar graphs
• Bounds for the chromatic number of a graph
• Planar graphs have bounded nonrepetitive chromatic number
• Upper bounds of entire chromatic number of plane graphs
• The complete chromatic number of some planar graphs
• The complete chromatic number of some planar graphs
• Some bounds for the \(b\)-chromatic number of a graph
• A lower bound for the chromatic number of a graph
• The chromatic number of the plane: the bounded case

zbMATH Keywords

graph drawing\(k\)-planar graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites Work

• Every planar map is four colorable. I: Discharging
• Every planar map is four colorable. II: Reducibility
• Graphs drawn with few crossings per edge
• The four-colour theorem
• Every Planar Map is Four Colorable
• SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM

Cited In (6)

• An upper bound of linear chromatic number of planar graphs
• Upper bounds of entire chromatic number of plane graphs
• Title not available (Why is that?)
• On graphs, which can be drawn on an orientable surface with small number of intersections on an edge
• New upper bound on the chromatic number of the square of a planar graph
• A dualistic approach to bounding the chromatic number of a graph

This page was built for publication: A bound on the chromatic number of an almost planar graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q744556)