✦ LIBER ✦

A linear time algorithm for 7-[3]coloring triangle-free hexagonal graphs

✍ Scribed by Petra Šparl; Rafał Witkowski; Janez Žerovnik

Book ID: 113663338
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 173 KB
Volume: 112
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2012.02.008

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Linear-Time Algorithm for 7-Coloring 1

A Linear-Time Algorithm for 7-Coloring 1-Plane Graphs

✍ Zhi-Zhong Chen; Mitsuharu Kouno 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 359 KB

A Simple Linear Time Algorithm for Trian

A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs

✍ H. Bodlaender; T. Kloks 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 560 KB

In this paper we consider the problem of determining whether a given colored graph can be triangulated, such that no edges between vertices of the same color are added. This problem originated from the perfect phylogeny problem from molecular biology and is strongly related with the problem of recog

A note on a linear time algorithm for co

A note on a linear time algorithm for constructing adjacency graphs of 3D FEA data

✍ S. K. Ueng,K. Sikorski 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 815 KB