๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Some trees are not interval graphs

โœ Scribed by Joel E. Cohen


Book ID
112753757
Publisher
Springer
Year
1981
Tongue
English
Weight
21 KB
Volume
43
Category
Article
ISSN
1522-9602

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Some trees are not interval graphs
โœ Joel E. Cohen ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› Springer ๐ŸŒ English โš– 21 KB

A flattering review (Rosen, 1980) of my book (Cohen, 1978) asserts that "any tree is an interval graph". In fact, infinitely many trees are not interval graphs. Here is a picture of one.

Which trees are link graphs?
โœ Andreas Blass; Frank Harary; Zevi Miller ๐Ÿ“‚ Article ๐Ÿ“… 1980 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 827 KB
Graphs whose powers are chordal and grap
โœ Flotow, Carsten ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 127 KB ๐Ÿ‘ 3 views

The main theorem of this paper gives a forbidden induced subgraph condition on G that is sufficient for chordality of G m . This theorem is a generalization of a theorem of Balakrishnan and Paulraja who had provided this only for m = 2. We also give a forbidden subgraph condition on G that is suffi

Some remarks on interval graphs
โœ R. Halin ๐Ÿ“‚ Article ๐Ÿ“… 1982 ๐Ÿ› Springer-Verlag ๐ŸŒ English โš– 439 KB