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

Coloring Fuzzy Circular Interval Graphs

โœ Scribed by Friedrich Eisenbrand; Martin Niemeier

Book ID
108120724
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
174 KB
Volume
34
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Coloring interval graphs with first-fit
Coloring interval graphs with first-fit
โœ H.A. Kierstead; Jun Qin ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 569 KB

Improved bounds on the performance of the on-line graph coloring algorithm First-Fit on interval graphs are obtained.

Interval bigraphs and circular arc graph
Interval bigraphs and circular arc graphs
โœ Pavol Hell; Jing Huang ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 130 KB

## Abstract We prove that the complements of interval bigraphs are precisely those circular arc graphs of clique covering number two, which admit a representation without two arcs covering the whole circle. We give another characterization of interval bigraphs, in terms of a vertex ordering, that w

Circular colorings of weighted graphs
Circular colorings of weighted graphs
โœ Deuber, Walter A.; Zhu, Xuding ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 776 KB

Suppose that G is a finite simple graph and w is a weight function which assigns to each vertex of G a nonnegative real number. Let C be a circle of length t . A t-circular coloring of (G,w) is a mapping A of the vertices of G to arcs of C such that A(%) n A(y) = 0 if (x, y) E E ( G ) and A(x) has l