scientific article; zbMATH DE number 4089589

MaRDI QIDQ3818345zbMATH OpenFDO

Authors Kenneth A. Berman, Jerome L. Paul

Publication date 1987

zbMATH Keywords

monochromatic pathoutergenusplanar graphs

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)

Recommendations

• Colouring planar graphs with three colours and no large monochromatic components
• Colorings of plane graphs without long monochromatic facial paths
• Planar graphs without cycles of length from 4 to 7 are 3-colorable
• Path choosability of planar graphs
• Chromatic number of graphs each path of which is 3-colourable

Cited in

(4)

• A condition for the three colourability of planar locally path graphs
• A 4-Color Theorem for Surfaces of Genus g
• Colouring planar graphs with three colours and no large monochromatic components
• Long monochromatic even cycles in 3‐edge‐coloured graphs of large minimum degree

This page was built for publication:

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