An upper bound for total colouring of graphs, Discrete Mathematics 111 (1993) 3899392. We give an upper bound on the number of colours required to extend a given vertex colouring of a graph to a total colouring. This shows that for any simple graph there is a total colouring using at most :d + 3 co
Universality of Embeddability Relations for Coloured Total Orders
β Scribed by Riccardo Camerlo
- Publisher
- Springer Netherlands
- Year
- 2005
- Tongue
- English
- Weight
- 363 KB
- Volume
- 22
- Category
- Article
- ISSN
- 0167-8094
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
We give a new upper bound on the total chromatic number of a graph. This bound improves the results known for some classes of graphs. The bound is stated as follows: ZT ~< Z~ + L l3 ~ J + 2, where Z is the chromatic number, Z~ is the edge chromatic number (chromatic index) and ZT is the total chroma
The growth of pikeperch __Sander lucioperca__ was studied in 41 lakes in central Finland. The backcalculated average total length of 3 yearβold pikeperch was used as an indicator of growth. The growth correlated positively with total phosphorus and water colour and negatively with lake area and dept
It is shown that in a linearly ordered MV-algebra A, the implication is unique if and only if the identity function is the unique De Morgan automorphism on A. Modulo categorical equivalence, our uniqueness criterion recalls Ohkuma's rigidness condition for totally ordered abelian groups. We also sho