𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Chromatic uniqueness of certain complete tripartite graphs

✍ Scribed by G. C. Lau; Y. H. Peng

Publisher
Institute of Mathematics, Chinese Academy of Sciences and Chinese Mathematical Society
Year
2011
Tongue
English
Weight
194 KB
Volume
27
Category
Article
ISSN
1439-7617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The chromatic uniqueness of complete bip
The chromatic uniqueness of complete bipartite graphs
✍ Shaoji Xu πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 585 KB

Xu, S., The chromatic uniqueness of complete bipartite graphs, Discrete Mathematics 94 (1991) 153-159. This paper is partitioned into two parts. In the first part we determine the maximum number of induced complete bipartite subgraphs in graphs with some given conditions. Using a theorem given in th

Classes of chromatically unique graphs
Classes of chromatically unique graphs
✍ MieczysΕ‚aw Borowiecki; Ewa Drgas-Burchardt πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 263 KB
On the number of triangular embeddings o
On the number of triangular embeddings of complete graphs and complete tripartite graphs
✍ M. J. Grannell; M. Knor πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 159 KB

## Abstract We prove that for every prime number __p__ and odd __m__>1, as __s__β†’βˆž, there are at least __w__ face 2‐colorable triangular embeddings of __K__~__w, w, w__~, where __w__ = __m__Β·__p__^__s__^. For both orientable and nonorientable embeddings, this result implies that for infinitely many