๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Colorability of Planar Graphs with Isolated Nontriangular Faces

โœ Scribed by Mark N. Ellingham; Herbert Fleischner; Martin Kochol; Emanuel Wenger


Book ID
106047517
Publisher
Springer Japan
Year
2004
Tongue
English
Weight
224 KB
Volume
20
Category
Article
ISSN
0911-0119

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Uniqueness of colorability and colorabil
โœ David P. Dailey ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 224 KB

It is shown that two sorts of problems belong to the NP-complete clas~;~ First, it is proven that for a given k-colorable graph and a given k-coloring of that graph, determining wbether the graph is or is not uniquely k-colorable is NP-complete. Second, a result by Garey, Johnson, and Stockmeyer is

Acyclic edge coloring of planar graphs w
โœ Dรกvid Hudรกk; Frantiลกek Kardoลก; Borut Luลพar; Roman Sotรกk; Riste ล krekovski ๐Ÿ“‚ Article ๐Ÿ“… 2012 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 469 KB