Moore graphs and beyond: A survey of the degree/diameter problem. 2nd edition (1st in 2005)
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F49777513%3A23520%2F13%3A43919786" target="_blank" >RIV/49777513:23520/13:43919786 - isvavai.cz</a>
Result on the web
<a href="http://www.combinatorics.org/ojs/index.php/eljc/article/view/DS14/pdf" target="_blank" >http://www.combinatorics.org/ojs/index.php/eljc/article/view/DS14/pdf</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Moore graphs and beyond: A survey of the degree/diameter problem. 2nd edition (1st in 2005)
Original language description
The degree/diameter problem is to determine the largest graphs or digraphs of given maximum degree and given diameter. This survey aims to give an overview of the current state-of-the-art of the degree/diameter problem. 2nd edition (1st in 2005)
Czech name
—
Czech description
—
Classification
Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
BA - General mathematics
OECD FORD branch
—
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2013
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
ELECTRONIC JOURNAL OF COMBINATORICS
ISSN
1077-8926
e-ISSN
—
Volume of the periodical
20
Issue of the periodical within the volume
2
Country of publishing house
AU - AUSTRALIA
Number of pages
92
Pages from-to
1-92
UT code for WoS article
—
EID of the result in the Scopus database
—