𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Split graphs of Dilworth number 2

✍ Scribed by C. Benzaken; P.L. Hammer; D. de Werra

Publisher
Elsevier Science
Year
1985
Tongue
English
Weight
250 KB
Volume
55
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Threshold characterization of graphs wit
Threshold characterization of graphs with dilworth number two
✍ C. Benzaken; P. L. Hammer; D. de Werra πŸ“‚ Article πŸ“… 1985 πŸ› John Wiley and Sons 🌐 English βš– 692 KB

A graph with nodes 1. \_.., n is a threshold signed graph if one can find two positive real numbers S,T and real numbers a , , ..., a, associated with the vertices in such a way that i,j are linked iff either la, + a,/ 3 S or la, -ail T. Such graphs generalize threshold graphs. It is shown that thes

Generalized Split Graphs and Ramsey Numb
Generalized Split Graphs and Ramsey Numbers
✍ AndrΓ‘s GyΓ‘rfΓ‘s πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 283 KB

A graph G is called a ( p, q)-split graph if its vertex set can be partitioned into A, B so that the order of the largest independent set in A is at most p and the order of the largest complete subgraph in B is at most q. Applying a well-known theorem of Erdo s and Rado for 2-systems, it is shown th

Split dimension of graphs
Split dimension of graphs
✍ Arkady A. Chernyak; Zhanna A. Chernyak πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 380 KB

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