✦ LIBER ✦

The chromaticity of s-bridge graphs and related graphs

✍ Scribed by Shaoji Xu; Jinjie Liu; Yeehock Peng

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 516 KB
Volume: 135
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)e0091-h

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Chromaticity of triangulated graphs

✍ Paul Vaderlind 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 159 KB

A graph G is called triangulated (or rigid-circuit graph, or chordal graph) if every circuit of G with length greater than 3 has a chord. It can be shown (see, UI, . . . , u,, . Let G = G,.

The chromaticity of certain graphs with

The chromaticity of certain graphs with five triangles

✍ Nian-Zu Li; Earl Glen Whitehead Jr 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 397 KB

Let W(n, k) denote the graph of order n obtained from the wheel I+', by deleting all but k consecutive spokes. In this note, we study the chromaticity of graphs which share certain properties of U'(n, 6) which can be obtained from the coeffictents of the chromatic polynomial of W(n, 6). In particula

The fractional chromatic number of mycie

The fractional chromatic number of mycielski's graphs

✍ Michael Larsen; James Propp; Daniel Ullman 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 236 KB

The most familiar construction of graphs whose clique number is much smaller than their chromatic number is due to Mycielski, who constructed a sequence G, of triangle-free graphs with ,y(G,) = n. In this article, w e calculate the fractional chromatic number of G, and show that this sequence of num

On the chromatic number of multiple inte

On the chromatic number of multiple interval graphs and overlap graphs

✍ A. Gyárfás 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 374 KB

Let x(G) and o(G) denote the chromatic number and clique number of a graph G. We prove that x can be bounded by a function of o for two well-known relatives of interval graphs. Multiple interval graphs (the intersection graphs of sets which can be written as the union of t closed intervals of a line

The chromatic number of oriented graphs

✍ Sopena, Eric 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 198 KB 👁 2 views

We introduce in this paper the notion of the chromatic number of an oriented graph G (that is of an antisymmetric directed graph) defined as the minimum order of an oriented graph H such that G admits a homomorphism to H. We study the chromatic number of oriented k-trees and of oriented graphs with

Harmonious labelings of windmill graphs

Harmonious labelings of windmill graphs and related graphs

✍ D. Frank Hsu 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 115 KB

## Abstract A strongly harmonious labeling is the nonmodular version of a harmonious labeling. The windmill graph __K__^(__t__^)~__n__~ is the graph consisting of __t__ copies of the complete graph __K~n~__ with a vertex in common. It is shown that, for __t__ ≥ 1, __K__^(__t__^)~__n__~ is strongly