On recognizing Cayley graphs

DOI10.1007/3-540-45253-2_8MaRDI QIDQ2753924zbMATH OpenFDO

Authors Pierre Fraigniaud, Cyril Gavoille, Bernard Mans, Lali Barrière, John Michael Robson

Publication date 11 November 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-45253-2_8

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• scientific article; zbMATH DE number 742907
• Recognizing Cayley digraphs
• Cayley graphs
• scientific article; zbMATH DE number 2149408
• Cayley digraphs and graphs
• scientific article; zbMATH DE number 5202628
• scientific article; zbMATH DE number 1744089
• A note on Cayley graphs
• scientific article; zbMATH DE number 1824288
• Some problems on Cayley graphs

Cited in

(8)

• Testing isomorphism of central Cayley graphs over almost simple groups in polynomial time
• About some robustness and complexity properties of G-graphs networks
• Testing set proportionality and the Ádám isomorphism of circulant graphs
• Recognizing and testing isomorphism of Cayley graphs over an abelian group of order \(4p\) in polynomial time
• scientific article; zbMATH DE number 742907 (Why is no real title available?)
• On Cayley representations of finite graphs over abelian p-groups
• scientific article; zbMATH DE number 5202628 (Why is no real title available?)
• Weak sense of direction labelings and graph embeddings

This page was built for publication: On recognizing Cayley graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2753924)