✦ LIBER ✦

An algorithm for finding simultaneous homomorphic correspondences between graphs and their image graphs

✍ Scribed by Gregory H. Heil; Harrison C. White

Publisher: John Wiley and Sons
Year: 1976
Tongue: English
Weight: 685 KB
Volume: 21
Category: Article
ISSN: 8756-6079
DOI: 10.1002/bs.3830210105

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for finding factorizations

An algorithm for finding factorizations of complete graphs

✍ A. J. W. Hilton; Matthew Johnson 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 58 KB 👁 1 views

## Abstract We show how to find a decomposition of the edge set of the complete graph into regular factors where the degree and edge‐connectivity of each factor is prescribed. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 132–136, 2003

An algorithm for finding a large indepen

An algorithm for finding a large independent set in planar graphs

✍ Norishige Chiba; Takao Nishizeki; Nobuji Saito 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 333 KB 👁 1 views