✦ LIBER ✦

On the complexity of the black-and-white coloring problem on some classes of perfect graphs

✍ Scribed by Kloks, Ton; Poon, Sheung-Hung; Tsai, Feng-Ren; Wang, Yue-Li

Book ID: 122238228
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 395 KB
Volume: 532
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2013.10.024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of the selective graph

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

✍ Demange, Marc; Monnot, Jérôme; Pop, Petrica; Ries, Bernard 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 372 KB

On the complexity of the general colorin

On the complexity of the general coloring problem

✍ H.A. Maurer; J.H. Sudborough; E. Welzl 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 664 KB

The parity path problem on some subclass

The parity path problem on some subclasses of perfect graphs

✍ C.R. Satyan; C.Pandu Rangan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 560 KB

On the Complexity of Recognizing Hamming

On the Complexity of Recognizing Hamming Graphs and Related Classes of Graphs

✍ Wilfried Imrich; Sandi Klavzar 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 287 KB

On the complexity of a restricted list-c

On the complexity of a restricted list-coloring problem

✍ Moshe Dror; Gerd Finke; Sylvain Gravier; Wieslaw Kubiak 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 355 KB

On the two-edge-colorings of perfect gra

On the two-edge-colorings of perfect graphs

✍ Chính T. Hoàng 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 409 KB 👁 1 views

## Abstract We investigate the conjecture that a graph is perfect if it admits a two‐edge‐coloring such that two edges receive different colors if they are the nonincident edges of a __P__~4~ (chordless path with four vertices). Partial results on this conjecture are given in this paper. © 1995 Joh