✦ LIBER ✦

Acyclic orientations of a graph and chromatic and independence numbers

✍ Scribed by R.W Deming

Publisher: Elsevier Science
Year: 1979
Tongue: English
Weight: 614 KB
Volume: 26
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(79)90048-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

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 graph coloring and the complexit

Acyclic graph coloring and the complexity of the star chromatic number

✍ David R. Guichard 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 294 KB

## Abstract Star chromatic number, introduced by A. Vince, is a natural generalization of chromatic number. We consider the question, “When is χ\* < χ?” We show that χ\* < χ if and only if a particular digraph is acyclic and that the decisioin problem associated with this question is probably not i

On local and global independence numbers

On local and global independence numbers of a graph

✍ Ralph J. Faudree; Zdeněk Ryjáček; Richard H. Schelp 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 121 KB

The local independence number i (G) of a graph G at a distance i is the maximum number of independent vertices at distance i from any vertex. We study the impact of restricting i (G) on the (global) independence number (G). Among others, we show that in graphs with bounded diameter, (G) is bounded i

Rank and chromatic number of a graph

✍ Kotlov, Andrei? 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 105 KB 👁 2 views

It was proved (A. Kotlov and L. Lovász, The rank and size of graphs, J. Graph Theory 23 (1996), 185-189) that the number of vertices in a twin-free graph is O(( √ 2) r ) where r is the rank of the adjacency matrix. This bound was shown to be tight. We show that the chromatic number of a graph is o(∆

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