✦ LIBER ✦

Graphs and Permutations

✍ Scribed by JUDITH Q. LONGYEAR

Book ID: 119862789
Publisher: John Wiley and Sons
Year: 1989
Tongue: English
Weight: 172 KB
Volume: 576
Category: Article
ISSN: 0890-6564
DOI: 10.1111/j.1749-6632.1989.tb16421.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Packing of graphs and permutations

✍ Mariusz Woźniak 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 269 KB

Self-clique graphs and matrix permutatio

Self-clique graphs and matrix permutations

✍ Adrian Bondy; Guillermo Durán; Min Chih Lin; Jayme L. Szwarcfiter 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 140 KB

## Abstract The __clique graph__ of a graph is the intersection graph of its (maximal) cliques. A graph is __self‐clique__ when it is isomorphic with its clique graph, and is __clique‐Helly__ when its cliques satisfy the Helly property. We prove that a graph is clique‐Helly and self‐clique if and o

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

Graph-Different Permutations

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

Split Permutation Graphs

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