✦ LIBER ✦

On generalized split graphs

✍ Scribed by Pavol Hell; Sulamita Klein; Fabio Protti; Loana Tito

Book ID: 108497988
Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 236 KB
Volume: 7
Category: Article
ISSN: 1571-0653
DOI: 10.1016/s1571-0653(04)00234-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Algorithms for unipolar and generalized

Algorithms for unipolar and generalized split graphs

✍ Eschen, Elaine M.; Wang, Xiaoqiang 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 378 KB

On generalized graphs

✍ B. Bollobás 📂 Article 📅 1965 🏛 Akadmiai Kiad 🌐 English ⚖ 319 KB

Retractions of split graphs and End-orth

Retractions of split graphs and End-orthodox split graphs

✍ Suohai Fan 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 68 KB

Split Permutation Graphs

✍ Nicholas Korpelainen, Vadim V. Lozin, Colin Mayhill 📂 Article 📅 2013 🏛 Springer Japan 🌐 English ⚖ 296 KB

A note on Hamiltonian split graphs

✍ Rainer E Burkard; Peter L Hammer 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 230 KB