J 2010

Coloring Plane Graphs with Independent Crossings

KRÁĽ, Daniel and L STACHO

Basic information

Original name

Coloring Plane Graphs with Independent Crossings

Authors

KRÁĽ, Daniel and L STACHO

Edition

Journal of Graph Theory, HOBOKEN, Wiley, 2010, 0364-9024

Other information

Language

English

Type of outcome

Article in a journal

Confidentiality degree

is not subject to a state or trade secret

Impact factor

Impact factor: 0.561

DOI

UT WoS

000278919700002

Keywords in English

planar graphs; cyclic coloring; crossing number; chromatic number
Changed: 6/11/2020 09:34, Mgr. Darina Boukalová

Abstract

In the original language

We show that every plane graph with maximum face size four in which all faces of size four are vertex-disjoint is cyclically 5-colorable. This answers a question of Albertson whether graphs drawn in the plane with all crossings independent are 5-colorable. (C) 2009 Wiley Periodicals, Inc. J Graph Theory 64: 184-205. 2010