𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The total chromatic number of nearly complete bipartite graphs

✍ Scribed by A.J.W Hilton

Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
753 KB
Volume
52
Category
Article
ISSN
0095-8956

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

Total chromatic number of complete r-par
Total chromatic number of complete r-partite graphs
✍ K. H. Chew; H. P. Yap πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 284 KB πŸ‘ 1 views

## Abstract Rosenfeld (1971) proved that the Total Colouring Conjecture holds for balanced complete __r__‐partite graphs. Bermond (1974) determined the exact total chromatic number of every balanced complete __r__‐partite graph. Rosenfeld's result had been generalized recently to complete __r__‐par

The total chromatic number of regular gr
The total chromatic number of regular graphs whose complement is bipartite
✍ J.K. Dugdale; A.J.W. Hilton πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 705 KB

We show that a regular graph G of order at least 6 whose complement c is bipartite has total chromatic number d(G) + 1 if and only if (i) G is not a complete graph, and (ii) G#K when n is even. As an aid in"';he proof of this, we also show that , for n>4, if the edges of a Hamiltonian path of Kzn a

The maximal number of induced complete b
The maximal number of induced complete bipartite graphs
✍ BΓ©la BollobΓ‘s; ChiΓͺ Nara; Shun-ichi Tachibana πŸ“‚ Article πŸ“… 1986 πŸ› Elsevier Science 🌐 English βš– 230 KB

The aim of this paper is to determine the maximal number of induced K(t, t) subgraphs in graphs of given order and in graphs of given size. Given a graph G and a natural number t, denote by ft(G) the number of induced subgraphs of G isomorphic to K(t, t). Our notation is that of ; in particular, K(