✦ LIBER ✦

Bounds on the chromatic polynomial and on the number of acyclic orientations of a graph

✍ Scribed by Nabil Kahale; Leonard J. Schulman

Publisher: Springer-Verlag
Year: 1996
Tongue: English
Weight: 743 KB
Volume: 16
Category: Article
ISSN: 0209-9683
DOI: 10.1007/bf01261322

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bounds on the Generalised Acyclic Chroma

Bounds on the Generalised Acyclic Chromatic Numbers of Bounded Degree Graphs

✍ Catherine Greenhill; Oleg Pikhurko 📂 Article 📅 2005 🏛 Springer Japan 🌐 English ⚖ 143 KB

On the Acyclic Chromatic Number of Hammi

On the Acyclic Chromatic Number of Hamming Graphs

✍ Robert E. Jamison; Gretchen L. Matthews 📂 Article 📅 2008 🏛 Springer Japan 🌐 English ⚖ 160 KB

Acyclic orientations of a graph and chro

Acyclic orientations of a graph and chromatic and independence numbers

✍ R.W Deming 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 614 KB

A bound on the chromatic number of a gra

A bound on the chromatic number of a graph

✍ Paul A. Catlin 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 392 KB

We give an upper bound on the chromatic number of a graph in terms of its maximum degree and the size of the largest complete subgraph. Our result extends a theorem due to i3rook.s.

On the chromatic polynomial of a graph

✍ David Avis; Caterina De Simone; Paolo Nobili 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 121 KB

Another bound on the chromatic number of

Another bound on the chromatic number of a graph

✍ Paul A. Catlin 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 422 KB

Let C be a simple graph. let JiGI denote the maximum degree of it\ \erlicek. ,III~ Ic~r \ 1 C; 1 denote irs chromatic pumber. Brooks' Theorem asserb lha1 ytG I'--AI G I. unk\\ C; hd.. .I component that is a COI lplete graph K,,,,\_ ,. or ullesq .I1 G I = 2 and G ha\ ;~n c~rld C\CIC