A note on the minimum cut cover of graphs

DOI10.1016/0167-6377(94)90077-9zbMath0816.90128OpenAlexW1978108716MaRDI QIDQ1342081

Lih-Hsing Hsu, Tung-Yang Ho

Publication date: 13 July 1995

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(94)90077-9

zbMATH Keywords

chromatic numberplanar graphlayouts of printed circuit boardminimum cardinality of cut cover

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items (1)

On fractional cut covers

Cites Work

• Unnamed Item
• Unnamed Item
• Minimal cut cover of a graph with an application to the testing of electronic boards
• Every planar map is four colorable. II: Reducibility

This page was built for publication: A note on the minimum cut cover of graphs