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

Split dimension of graphs

โœ Scribed by Arkady A. Chernyak; Zhanna A. Chernyak


Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
380 KB
Volume
89
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

โœฆ Synopsis


Chernyak,

A.A. and Z.A. Chernyak, Split dimension of graphs, Discrete Mathematics 89 (1991) l-6.


๐Ÿ“œ SIMILAR VOLUMES


Endomorphismโ€”Regularity of Split Graphs
โœ Weimin Li; Jianfei Chen ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 126 KB

In this paper, split graphs with a regular endomorphism monoid are characterized explicitly.

Absolute retracts of split graphs
โœ Sandi Klavลพar ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 663 KB

It is proved that a split graph is an absolute retract of split graphs if and only if a partition of its vertex set into a stable set and a complete set is unique or it is a complete split graph. Three equivalent conditions for a split graph to be an absolute retract of the class of all graphs are g

The dimension of sums of graphs
โœ Peter Alles ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 235 KB

For a graph G, dim G is defined to be the least natural number n such that G is an induced subgraph of a categorial (or direct) product of n complete graphs. The dimension of sums of graphs has been studied in [3] and [8]. The aim if this article is to improve the upper estimates achieved by Poljak

Split graphs of Dilworth number 2
โœ C. Benzaken; P.L. Hammer; D. de Werra ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 250 KB
On clique partitions of split graphs
โœ W.D. Wallis; J. Wu ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 204 KB

Wallis, W.D. and J. Wu, On clique partitions of split graphs, Discrete Mathematics 92 (1991) 427-429. Split graphs are graphs formed by taking a complete graph and an empty graph disjoint from it and some or all of the possible edges joining the two. We prove that the problem of deciding the clique

Toughness, hamiltonicity and split graph
โœ Dieter Kratsch; Jenล‘ Lehel; Haiko Mรผller ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 728 KB