✦ LIBER ✦

Stability number and chromatic number of tolerance graphs

✍ Scribed by Giri Narasimhan; Rachel Manber

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 954 KB
Volume: 36
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90203-m

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Circular Chromatic Numbers and Fractiona

Circular Chromatic Numbers and Fractional Chromatic Numbers of Distance Graphs

✍ G.J. Chang; L. Huang; X. Zhu 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 171 KB

This paper studies circular chromatic numbers and fractional chromatic numbers of distance graphs G(Z , D) for various distance sets D. In particular, we determine these numbers for those D sets of size two, for some special D sets of size three, for

Edge-face chromatic number and edge chro

Edge-face chromatic number and edge chromatic number of simple plane graphs

✍ Rong Luo; Cun-Quan Zhang 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 201 KB

## Abstract Given a simple plane graph __G__, an edge‐face __k__‐coloring of __G__ is a function ϕ : __E__(__G__) ∪ __F__(G) → {1,…,__k__} such that, for any two adjacent or incident elements __a__, __b__ ∈ __E__(__G__) ∪ __F__(__G__), ϕ(__a__) ≠ ϕ(__b__). Let χ~e~(__G__), χ~ef~(__G__), and Δ(__G_

Subgraphs of large connectivity and chro

Subgraphs of large connectivity and chromatic number in graphs of large chromatic number

✍ N. Alon; D. Kleitman; C. Thomassen; M. Saks; P. Seymour 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB

For each pair k, rn of natural numbers there exists a natural number f(k, rn) such that every f ( k , m)-chromatic graph contains a k-connected subgraph of chromatic number at least rn.

Regular graphs and edge chromatic number

✍ R.J Faudree; J Sheehan 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 376 KB

For any simple graph G, Vizing's Theorem [5] implies that A (G)~)((G)<~ A(G)+ 1, where A (G) is the maximum degree of a vertex in G and x(G) is the edge chromatic number. It is of course possible to add edges to G without changing its edge chromatic number. Any graph G is a spanning subgraph of an e

Multichromatic numbers, star chromatic n

Multichromatic numbers, star chromatic numbers and Kneser graphs

✍ Johnson, A.; Holroyd, F. C.; Stahl, S. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB 👁 1 views

We investigate the relation between the multichromatic number (discussed by Stahl and by Hilton, Rado and Scott) and the star chromatic number (introduced by Vince) of a graph. Denoting these by χ \* and η \* , the work of the above authors shows that χ \* (G) = η \* (G) if G is bipartite, an odd cy

Oriented hypergraphs, stability numbers

Oriented hypergraphs, stability numbers and chromatic numbers

✍ Heinrich Müller 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 232 KB

Oriented hypergraphs are defined, so that it is possible to genc&ze popositions characterizing the chromatic number and the stability number of a graph by means of crientations i!tnd elementary paths, to the strong and weak chromatic number and the strong and we& stability number of a hypergraph.