✦ LIBER ✦

On the separability of graphs

✍ Scribed by Schaudt, Oliver; Schrader, Rainer; Weil, Vera

Book ID: 118737075
Publisher: Elsevier Science
Year: 2013
Tongue: English
Weight: 267 KB
Volume: 313
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2012.12.023

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Conjugacy Separability of Certain

On the Conjugacy Separability of Certain Graphs of Groups

✍ E Raptis; O Talelli; D Varsos 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 163 KB

On the separation number of a graph

✍ Zevi Miller; Dan Pritikin 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 781 KB

We consider the following graph labeling problem, introduced by Leung et al. (3. Y-T. Leung, 0. Vornberger, and J. D. Witthoff, On some variants of the bandwidth minimization problem. SIAM J. Comput. 13 (1984) 650-667). Let G be a graph of order n, and f a bijection from the separation number of G,

Asymptotic Bounds on the Integrity of Gr

Asymptotic Bounds on the Integrity of Graphs and Separator Theorems for Graphs

✍ Benko, D.; Ernst, C.; Lanphier, D. 📂 Article 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 217 KB

On connection between the switching sepa

On connection between the switching separability of a graph and its subgraphs

✍ D. S. Krotov 📂 Article 📅 2011 🏛 Pleiades Publishing 🌐 English ⚖ 500 KB

One-phase algorithm for the determinatio

One-phase algorithm for the determination of minimal vertex separators of chordal graphs

✍ Lilian Markenzon; Paulo Renato Da Costa Pereira 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 151 KB

Graphs of separability at most 2

✍ Ferdinando Cicalese; Martin Milanič 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 288 KB