𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An upper bound on the chromatic number of a circle graph withoutK4

✍ Scribed by G. V. Nenashev

Book ID
113072928
Publisher
Springer US
Year
2012
Tongue
English
Weight
227 KB
Volume
184
Category
Article
ISSN
1573-8795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On an upper bound for the harmonious chr
On an upper bound for the harmonious chromatic number of a graph
✍ Zhikang Lu πŸ“‚ Article πŸ“… 1991 πŸ› John Wiley and Sons 🌐 English βš– 125 KB πŸ‘ 2 views

## Abstract The upper bound for the harmonious chromatic number of a graph that has been given by Sin‐Min Lee and John Mitchem is improved.

An upper bound for the harmonious chroma
An upper bound for the harmonious chromatic number of a graph
✍ Sin-Min Lee; John Mitchem πŸ“‚ Article πŸ“… 1987 πŸ› John Wiley and Sons 🌐 English βš– 149 KB πŸ‘ 2 views

An upper bound for the harmonious chromatic number of a graph G is given. Three corollaries of the theorem are theorems or improvements of the theorems of Miller and Pritikin. The assignment of colors to the vertices of a graph such that each vertex has exactly one color has been studied for well o

An upper bound for the total chromatic n
An upper bound for the total chromatic number of dense graphs
✍ H. R. Hind πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 340 KB πŸ‘ 1 views

## Abstract In this paper we consider those graphs that have maximum degree at least 1/__k__ times their order, where __k__ is a (small) positive integer. A result of Hajnal and SzemerΓ©di concerning equitable vertex‐colorings and an adaptation of the standard proof of Vizing's Theorem are used to s

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.