Distinguishing infinite graphs.
Imrich, Wilfried; Klavžar, Sandi; Trofimov, Vladimir
The Electronic Journal of Combinatorics [electronic only] (2007)
- Volume: 14, Issue: 1, page Research paper R36, 12 p.-Research paper R36, 12 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topImrich, Wilfried, Klavžar, Sandi, and Trofimov, Vladimir. "Distinguishing infinite graphs.." The Electronic Journal of Combinatorics [electronic only] 14.1 (2007): Research paper R36, 12 p.-Research paper R36, 12 p.. <http://eudml.org/doc/128105>.
@article{Imrich2007,
author = {Imrich, Wilfried, Klavžar, Sandi, Trofimov, Vladimir},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {labeling; automorphism; countable random graph},
language = {eng},
number = {1},
pages = {Research paper R36, 12 p.-Research paper R36, 12 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Distinguishing infinite graphs.},
url = {http://eudml.org/doc/128105},
volume = {14},
year = {2007},
}
TY - JOUR
AU - Imrich, Wilfried
AU - Klavžar, Sandi
AU - Trofimov, Vladimir
TI - Distinguishing infinite graphs.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2007
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 14
IS - 1
SP - Research paper R36, 12 p.
EP - Research paper R36, 12 p.
LA - eng
KW - labeling; automorphism; countable random graph
UR - http://eudml.org/doc/128105
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.