Width compactness theorem and well-quasi-ordering infinite graphs
Commentationes Mathematicae Universitatis Carolinae (1986)
- Volume: 027, Issue: 1, page 206-208
- ISSN: 0010-2628
Access Full Article
top
How to cite
topThomas, Robin D.. "Width compactness theorem and well-quasi-ordering infinite graphs." Commentationes Mathematicae Universitatis Carolinae 027.1 (1986): 206-208. <http://eudml.org/doc/17451>.
@article{Thomas1986,
author = {Thomas, Robin D.},
journal = {Commentationes Mathematicae Universitatis Carolinae},
language = {eng},
number = {1},
pages = {206-208},
publisher = {Charles University in Prague, Faculty of Mathematics and Physics},
title = {Width compactness theorem and well-quasi-ordering infinite graphs},
url = {http://eudml.org/doc/17451},
volume = {027},
year = {1986},
}
TY - JOUR
AU - Thomas, Robin D.
TI - Width compactness theorem and well-quasi-ordering infinite graphs
JO - Commentationes Mathematicae Universitatis Carolinae
PY - 1986
PB - Charles University in Prague, Faculty of Mathematics and Physics
VL - 027
IS - 1
SP - 206
EP - 208
LA - eng
UR - http://eudml.org/doc/17451
ER -
References
top- N. Robertson P. O. Seymour, Graph minors III. Planar Tree-Width, J. Combin. Theory, ser. B 36, 49-64 (1984). (1984) MR0742386
- C. St. J. A. Nash-Williams, On well-quasi-ordering infinite trees, Proc. Camb. Phil. Soc. 61 (1965), 697-720. (1965) Zbl0144.23305MR0175814
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.