✦ LIBER ✦

A criterion for recognizing similarity in graphs

✍ Scribed by M. Staniszkis Marzollo

Book ID: 110562211
Publisher: Springer Milan
Year: 1976
Tongue: English
Weight: 357 KB
Volume: 13
Category: Article
ISSN: 0008-0624
DOI: 10.1007/bf02575940

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A similarity criterion for electrical di

✍ G. Yu. Daumov 📂 Article 📅 1972 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 183 KB

A similarity measure for conceptual grap

✍ Peter E. Maher 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 779 KB

This article introduces a mechanism to compare two conceptual graphs and produce a similarity measure, reflecting incomplete, imprecise, or inconsistent information. It is then shown that conceptual graphs, in conjunction with the similarity measure, can be effectively used to define concepts by mea

A local criterion for Tverberg graphs

✍ Alexander Engström 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 202 KB

A reduction criterion for supereulerian

A reduction criterion for supereulerian graphs

✍ Catlin, Paul A. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 162 KB 👁 2 views

Let G be a graph, and let H be a connected subgraph of G. When it is known that the graph G/H (obtained from G by contracting H to a vertex) has a spanning eulerian subgraph, under what conditions can it be inferred that G itself has a spanning eulerian subgraph? 0 1996 John Wiley & Sons, Inc.

A similarity criterion for creep of meta

✍ V. A. Strizhalo 📂 Article 📅 1984 🏛 Springer 🌐 English ⚖ 294 KB

Recognizing Dart-Free Perfect Graphs

✍ Chvátal, V.; Fonlupt, J.; Sun, L.; Zemirline, A. 📂 Article 📅 2002 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 252 KB