A technique for graph embedding with constraints on node and arc correspondences

DOI10.1016/0020-0255(73)90001-7zbMath0247.05146OpenAlexW1965670246MaRDI QIDQ2555871

Giorgio Levi, Fabrizio Luccio

Publication date: 1973

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0255(73)90001-7

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graph theory (05C99)

Related Items (2)

A weighted graph embedding technique and its application to automatic circuit layout ⋮ A note on the derivation of maximal common subgraphs of two directed or undirected graphs

Cites Work

• An Efficient Algorithm for Graph Isomorphism
• Unnamed Item

This page was built for publication: A technique for graph embedding with constraints on node and arc correspondences