Decomposing infinite 2-connected graphs into 3-connected components.
The Electronic Journal of Combinatorics [electronic only] (2004)
- Volume: 11, Issue: 1, page Research paper R25, 10 p.-Research paper R25, 10 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topRichter, R. Bruce. "Decomposing infinite 2-connected graphs into 3-connected components.." The Electronic Journal of Combinatorics [electronic only] 11.1 (2004): Research paper R25, 10 p.-Research paper R25, 10 p.. <http://eudml.org/doc/124309>.
@article{Richter2004,
author = {Richter, R. Bruce},
journal = {The Electronic Journal of Combinatorics [electronic only]},
keywords = {connectivity; decomposition; infinite planar graphs},
language = {eng},
number = {1},
pages = {Research paper R25, 10 p.-Research paper R25, 10 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Decomposing infinite 2-connected graphs into 3-connected components.},
url = {http://eudml.org/doc/124309},
volume = {11},
year = {2004},
}
TY - JOUR
AU - Richter, R. Bruce
TI - Decomposing infinite 2-connected graphs into 3-connected components.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 2004
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 11
IS - 1
SP - Research paper R25, 10 p.
EP - Research paper R25, 10 p.
LA - eng
KW - connectivity; decomposition; infinite planar graphs
UR - http://eudml.org/doc/124309
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.