Recognizing circulant graphs of prime order in polynomial time.
Muzychuk, Mikhail; Tinhofer, Gottfried
The Electronic Journal of Combinatorics [electronic only] (1998)
- Volume: 5, Issue: 1, page Research paper 25, 28 p.-Research paper 25, 28 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topMuzychuk, Mikhail, and Tinhofer, Gottfried. "Recognizing circulant graphs of prime order in polynomial time.." The Electronic Journal of Combinatorics [electronic only] 5.1 (1998): Research paper 25, 28 p.-Research paper 25, 28 p.. <http://eudml.org/doc/119615>.
@article{Muzychuk1998,
author = {Muzychuk, Mikhail, Tinhofer, Gottfried},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {recognition algorithm; circulant graph; cyclic association scheme},
language = {eng},
number = {1},
pages = {Research paper 25, 28 p.-Research paper 25, 28 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Recognizing circulant graphs of prime order in polynomial time.},
url = {http://eudml.org/doc/119615},
volume = {5},
year = {1998},
}
TY - JOUR
AU - Muzychuk, Mikhail
AU - Tinhofer, Gottfried
TI - Recognizing circulant graphs of prime order in polynomial time.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 1998
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 5
IS - 1
SP - Research paper 25, 28 p.
EP - Research paper 25, 28 p.
LA - eng
KW - recognition algorithm; circulant graph; cyclic association scheme
UR - http://eudml.org/doc/119615
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.