𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Br property and chromatic numbers of generalized graphs

✍ Scribed by M Herzog; J Schönheim

Publisher
Elsevier Science
Year
1972
Tongue
English
Weight
444 KB
Volume
12
Category
Article
ISSN
0095-8956

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

Path chromatic numbers of graphs
Path chromatic numbers of graphs
✍ Jin Akiyama; Hiroshi Era; Severino V. Gervacio; Mamoru Watanabe 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 112 KB
Generalizations of independence and chro
Generalizations of independence and chromatic numbers of a graph
✍ E. Sampathkumar 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 426 KB

Sampathkumar, E., Generalizations of independence and chromatic numbers of a graph, Discrete Mathematics 115 (1993) 2455251. Let G = (V, E) be a graph and k > 2 be an integer. A set S c V is k-independent if every component in the subgraph (S) induced by S has order at most k-1. The general chromati

Acyclic and oriented chromatic numbers o
Acyclic and oriented chromatic numbers of graphs
✍ Kostochka, A. V.; Sopena, E.; Zhu, X. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 121 KB 👁 2 views

The oriented chromatic number χ o ( G) of an oriented graph G = (V, A) is the minimum number of vertices in an oriented graph H for which there exists a homomorphism of G to H. The oriented chromatic number χ o (G) of an undirected graph G is the maximum of the oriented chromatic numbers of all the

Star chromatic numbers and products of g
Star chromatic numbers and products of graphs
✍ Xuding Zhu 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 666 KB

## Abstract The star‐chromatic number of a graph, a concept introduced by Vince, is natural generalization of the chromatic number of a graph. We point out an alternate definition of the star‐chromatic number, which sheds new light on the relation of the star‐chromatic number and the ordinary chrom