On the coding of ordered graphs

DOI10.1007/BF02684448zbMath0912.05047MaRDI QIDQ1266307

Horst Bunke, Xiaoyi Jiang

Publication date: 9 May 1999

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

isomorphismcodingordered graph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Graph isomorphism is in the low hierarchy
• Isomorphism of graphs of bounded valence can be tested in polynomial time
• A V log V algorithm for isomorphism of triconnected planar graphs
• Further annotated bibliography on the isomorphism disease
• An Algorithm for Subgraph Isomorphism
• The graph isomorphism disease
• Unnamed Item
• Unnamed Item

This page was built for publication: On the coding of ordered graphs