๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Graph coloring in linear time

โœ Scribed by Zsolt Tuza

Book ID
107884332
Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
477 KB
Volume
55
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

4-edge-coloring graphs of maximum degree
4-edge-coloring graphs of maximum degree 3 in linear time
โœ San Skulrattanakulchai ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 65 KB

We present a linear time algorithm to properly color the edges of any graph of maximum degree 3 using 4 colors. Our algorithm uses a greedy approach and utilizes a new structure theorem for such graphs.

Linear coloring of graphs
Linear coloring of graphs
โœ Raphael Yuster ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 213 KB

A proper vertex coloring of a graph is called linear if the subgraph induced by the vertices colored by any two colors is a set of vertex-disjoint paths. The linear chromatic number of a graph G, denoted by lc(G), is the minimum number of colors in a linear coloring of G. Extending a result of Alon,

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