✦ LIBER ✦

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

✍ Scribed by Zhi-Zhong Chen; Mitsuharu Kouno

Publisher: Springer
Year: 2005
Tongue: English
Weight: 359 KB
Volume: 43
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-004-1134-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

New Linear-Time Algorithms for Edge-Colo

New Linear-Time Algorithms for Edge-Coloring Planar Graphs

✍ Richard Cole; Łukasz Kowalik 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 457 KB

A Simple Linear Time Algorithm for Prope

A Simple Linear Time Algorithm for Proper Box Rectangular Drawings of Plane Graphs

✍ Xin He 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 219 KB

In this paper we introduce a new style of drawing a plane graph G, called proper Ž . box rectangular PBR drawing. It is defined to be a drawing of G such that every vertex is drawn as a rectangle, called a box, each edge is drawn as either a horizontal or a vertical line segment, and each face is dr

A linear time algorithm for edge colorin

A linear time algorithm for edge coloring of binomial trees

✍ M. Kubale; K. Piwakowski 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 448 KB

We consider the problem of efficient coloring of the edges of a so-called binomial tree T, i.e. acyclic graph containing two kinds of edges: those which must have a single color and those which are to be colored with L consecutive colors, where L is an arbitrary integer greater than 1. We give an O(

A linear time algorithm for graph partit

A linear time algorithm for graph partition problems

✍ L.H. Clark; F. Shahrokhi; L.A. Székely 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 483 KB

A linear time recognition algorithm for

A linear time recognition algorithm for proper interval graphs

✍ B.S. Panda; Sajal K. Das 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 128 KB

We propose a linear time recognition algorithm for proper interval graphs. The algorithm is based on certain ordering of vertices, called bicompatible elimination ordering (BCO). Given a BCO of a biconnected proper interval graph G, we also propose a linear time algorithm to construct a Hamiltonian