𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The complexity of the chromatic sum problem on cubic planar graphs and regular graphs

✍ Scribed by Michal Malafiejski


Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
12 KB
Volume
8
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


The star-chromatic number of planar grap
✍ Moser, David πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 127 KB πŸ‘ 2 views

The star-chromatic number of a graph, a parameter introduced by Vince, is a natural generalization of the chromatic number of a graph. Here we construct planar graphs with star-chromatic number r, where r is any rational number between 2 and 3, partially answering a question of Vince.

On the vertex face total chromatic numbe
✍ Weifan, Wang; Jiazhuang, Liu πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 471 KB πŸ‘ 2 views

Let G be a planar graph. The vertex face total chromatic number ,y13(G) of G is the least number of colors assigned to V(G) U F(G) such that no adjacent or incident elements receive the same color. The main results of this paper are as follows: (1) We give the vertex face total chromatic number for

The complexity of the matching-cut probl
✍ Paul Bonsma πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 247 KB

## Abstract The Matching‐Cut problem is the problem to decide whether a graph has an edge cut that is also a matching. Previously this problem was studied under the name of the Decomposable Graph Recognition problem, and proved to be ${\cal{NP}}$‐complete when restricted to graphs with maximum deg

Tight bounds on the chromatic sum of a c
✍ Carsten Thomassen; Paul ErdΓΆs; Yousef Alavi; Paresh J. Malde; Allen J. Schwenk πŸ“‚ Article πŸ“… 1989 πŸ› John Wiley and Sons 🌐 English βš– 236 KB πŸ‘ 1 views