𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the complexity of the selective graph coloring problem in some special classes of graphs

✍ Scribed by Demange, Marc; Monnot, Jérôme; Pop, Petrica; Ries, Bernard

Book ID
122674069
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
372 KB
Volume
540-541
Category
Article
ISSN
0304-3975

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Comb
[Lecture Notes in Computer Science] Combinatorial Optimization Volume 7422 || Selective Graph Coloring in Some Special Classes of Graphs
✍ Mahjoub, A. Ridha; Markakis, Vangelis; Milis, Ioannis; Paschos, Vangelis Th. 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 225 KB

This book constitutes the thoroughly refereed post-conference proceedings of the Second International Symposium on Combinatorial Optimization, ISCO 2012, held in Athens, Greece, in April 2012. The 37 revised full papers presented together with 4 invited talks were carefully reviewed and selected fro

The complexity of the matching-cut probl
The complexity of the matching-cut problem for planar graphs and other graph classes
✍ 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