A note on the minimum cut cover of graphs
type: Item
instance of: scholarly article
title: A note on the minimum cut cover of graphs
zbMATH Open document ID: 0816.90128
DOI: 10.1016/0167-6377(94)90077-9
author: Tung-Yang Ho
author: Lih-Hsing Hsu
published in: Operations Research Letters
publication date: 1995-07-13T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 709957
zbMATH Keywords: chromatic number
zbMATH Keywords: minimum cardinality of cut cover
zbMATH Keywords: layouts of printed circuit board
zbMATH Keywords: planar graph
MaRDI profile type: Publication
full work available at URL: 0167-6377(94)90077-9
OpenAlex ID: W1978108716
cites work: Every planar map is four colorable. II: Reducibility
cites work: Q5422499
cites work: Q4198056
cites work: Minimal cut cover of a graph with an application to the testing of electronic boards
description: scientific article; zbMATH DE number 709957