𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graphical Eulerian numbers and chromatic generating functions

✍ Scribed by Ioan Tomescu

Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
217 KB
Volume
66
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper some further properties of the coefficients of a chromatic generating function introduced by Linial are proved. A combinatorial interpretation of these numbers is given by specializing some results of Stanley on posets to surjective n-colorings of a graph G of order n compatible with linear orders on V(G) which extend acyclic orientations of G.

πŸ“œ SIMILAR VOLUMES

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

Chromatic numbers of products of graphs:
Chromatic numbers of products of graphs: The directed and undirected versions of the Poljak-RΓΆdl function
✍ Claude Tardif; David Wehlau πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 61 KB

## Abstract Let __f__(__n__) = min{Ο‡(__G__ × __H__) : __G__ and __H__ are __n__‐chromatic digraphs} and __g__(__n__) = min{Ο‡(__G__ × __H__) : __G__ and __H__ are __n__‐chromatic graphs}. We prove that __f__ is bounded if and only if __g__ is bounded. Β© 2005 Wiley Periodicals, Inc. J Graph Theory