A note on the disconnection number
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F10%3A10057586" target="_blank" >RIV/00216208:11320/10:10057586 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
A note on the disconnection number
Original language description
We present a simple way to obtain all graphs with a given disconnection number if we know all the graphs with smaller disconnection number. Using this method we answer a question of Sam B. Nadler, i.e. we prove that there exist precisely 26 continua withdisconnection number four.
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
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2010
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
Topology and its Applications
ISSN
0166-8641
e-ISSN
—
Volume of the periodical
157
Issue of the periodical within the volume
18
Country of publishing house
NL - THE KINGDOM OF THE NETHERLANDS
Number of pages
3
Pages from-to
—
UT code for WoS article
000284082200012
EID of the result in the Scopus database
—