𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient algorithm to recognize locally equivalent graphs

✍ Scribed by André Bouchet

Publisher
Springer-Verlag
Year
1991
Tongue
English
Weight
723 KB
Volume
11
Category
Article
ISSN
0209-9683

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Recognizing locally equivalent graphs
Recognizing locally equivalent graphs
✍ André Bouchet 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 771 KB

Bouchet, A., Recognizing locally equivalent graphs, Discrete Mathematics 114 (1993) 75-86. To locally complement a simple graph Fat one of its vertices u is to replace the subgraph induced by F on n(o)= {w: w is an edge of F} by the complementary subgraph. Graphs related by a sequence of local comp

A linear time algorithm to recognize cir
A linear time algorithm to recognize circular permutation graphs
✍ Sritharan, R. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 368 KB

An undirected graph G is a circular permutation graph if it can be represented by the following intersectiori model: Each vertex of G corresponds to a chord in the annular region between two concentric circles, and two vertices are adjacent in G if and only if their corresponding chords intersect ea