𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the structure and chromaticity of graphs in which any two colour classes induce a tree

✍ Scribed by F.M. Dong; K.M. Koh

Book ID
108316099
Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
756 KB
Volume
176
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On graphs in which any pair of colour cl
On graphs in which any pair of colour classes but one induces a tree
✍ F.M. Dong; K.M. Koh πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 659 KB

For m >~ 3, let .~,, be the family of graphs G that possesses an independent set partition {AI ..... Am} such that the subgraphs of G induced by Ai U Aj are trees except one, which is a tbrest having two components. Let t(G) denote the number of triangles in G. It is shown that In this paper, we ch

On the density of 2-colorable 3-graphs i
On the density of 2-colorable 3-graphs in which any four points span at most two edges
✍ Klas MarkstrΓΆm; John Talbot πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 161 KB πŸ‘ 1 views

## Abstract Let __ex__~2~(__n, K__) be the maximum number of edges in a 2‐colorable __K__‐free 3‐graph (where __K__={123, 124, 134} ). The 2‐chromatic TurΓ‘n density of __K__ is \documentclass{article}\footskip=0pc\pagestyle{empty}\begin{document}$\pi\_{2}({K}\_{4}^-) =lim\_{{n}\to \infty} {ex}\_{2}