Relaxed two-coloring of cubic graphs
type: Item
instance of: scholarly article
title: Relaxed two-coloring of cubic graphs
zbMATH Open document ID: 1118.05029
author: Robert Berke
author: Tibor Szabó
published in: Journal of Combinatorial Theory. Series B
publication date: 2007-06-08T00:00:00Z
full work available at URL: dmAE0166.pdf
Mathematics Subject Classification ID: 05C15
zbMATH DE Number: 5162684
zbMATH Keywords: bounded degree graphs
zbMATH Keywords: colorings
MaRDI profile type: Publication
OpenAlex ID: W1994982407
cites work: Partitioning into graphs with only small components
cites work: Deciding Relaxed Two-Colourability: A Hardness Jump
cites work: Q5725269
cites work: Bounded size components -- partitions and transversals.
cites work: On the linear \(k\)-arboricity of cubic graphs
cites work: Q5530470
cites work: Two-coloring the edges of a cubic graph such that each monochromatic component is a path of length at most 5
DOI: 10.1016/J.JCTB.2006.12.001
description: scientific article; zbMATH DE number 5162684