✦ LIBER ✦

Split Permutation Graphs

✍ Scribed by Nicholas Korpelainen, Vadim V. Lozin, Colin Mayhill

Book ID: 120788829
Publisher: Springer Japan
Year: 2013
Tongue: English
Weight: 296 KB
Volume: 30
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-013-1290-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bipartite permutation graphs

✍ Jeremy Spinrad; Andreas Brandstädt; Lorna Stewart 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 912 KB

This paper examines the class ofbipartite permutation graphs. Two chaiacterizations of graphs i n this class are presented. These characterizations l ead to a linear time recognition algorithm, and to polynomial time algorithms for a number of NP-complete problems when restricted to graphs i n this

Circular permutation graphs

✍ D. Rotem; J. Urrutia 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 481 KB

Domination in permutation graphs

✍ Martin Farber; J Mark Keil 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 617 KB

Graph-Different Permutations

✍ Körner, János; Malvenuto, Claudia; Simonyi, Gábor 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 167 KB

Graphs and Permutations

✍ JUDITH Q. LONGYEAR 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 172 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