Finite graphs and digraphs which are not reconstructible from their cardinality restricted subgraphs
Commentationes Mathematicae Universitatis Carolinae (1981)
- Volume: 022, Issue: 2, page 281-287
- ISSN: 0010-2628
Access Full Article
top
How to cite
topNýdl, Václav. "Finite graphs and digraphs which are not reconstructible from their cardinality restricted subgraphs." Commentationes Mathematicae Universitatis Carolinae 022.2 (1981): 281-287. <http://eudml.org/doc/17107>.
@article{Nýdl1981,
author = {Nýdl, Václav},
journal = {Commentationes Mathematicae Universitatis Carolinae},
keywords = {Ulam conjecture; induced subgraphs},
language = {eng},
number = {2},
pages = {281-287},
publisher = {Charles University in Prague, Faculty of Mathematics and Physics},
title = {Finite graphs and digraphs which are not reconstructible from their cardinality restricted subgraphs},
url = {http://eudml.org/doc/17107},
volume = {022},
year = {1981},
}
TY - JOUR
AU - Nýdl, Václav
TI - Finite graphs and digraphs which are not reconstructible from their cardinality restricted subgraphs
JO - Commentationes Mathematicae Universitatis Carolinae
PY - 1981
PB - Charles University in Prague, Faculty of Mathematics and Physics
VL - 022
IS - 2
SP - 281
EP - 287
LA - eng
KW - Ulam conjecture; induced subgraphs
UR - http://eudml.org/doc/17107
ER -
References
top- NEŠETŘIL J., Teorie grafů, Praha, SNTL 1979. (1979)
- BONDY J. A., HEMMINGER R. L., Graph Reconstruction - a Survey, J. Graph Theory 1 (1977), 227-268. (1977) Zbl0375.05040MR0480189
- MULLER V., Probabilistic Reconstruction from Subgraphs, Comment. Math. Univ. Carolinae 17 (1976), 709-719. (1976) MR0441789
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.