A direct decomposition of 3-connected planar graphs.

Bodirsky, Manuel; Gröpl, Clemens; Johannsen, Daniel; Kang, Mihyun

Séminaire Lotharingien de Combinatoire [electronic only] (2005)

  • Volume: 54A, page B54Ak, 15 p., electronic only-B54Ak, 15 p., electronic only
  • ISSN: 1286-4889

How to cite

top

Bodirsky, Manuel, et al. "A direct decomposition of 3-connected planar graphs.." Séminaire Lotharingien de Combinatoire [electronic only] 54A (2005): B54Ak, 15 p., electronic only-B54Ak, 15 p., electronic only. <http://eudml.org/doc/227943>.

@article{Bodirsky2005,
author = {Bodirsky, Manuel, Gröpl, Clemens, Johannsen, Daniel, Kang, Mihyun},
journal = {Séminaire Lotharingien de Combinatoire [electronic only]},
keywords = {random sampling; planar graphs; algorithms},
language = {eng},
pages = {B54Ak, 15 p., electronic only-B54Ak, 15 p., electronic only},
publisher = {Universität Wien, Fakultät für Mathematik},
title = {A direct decomposition of 3-connected planar graphs.},
url = {http://eudml.org/doc/227943},
volume = {54A},
year = {2005},
}

TY - JOUR
AU - Bodirsky, Manuel
AU - Gröpl, Clemens
AU - Johannsen, Daniel
AU - Kang, Mihyun
TI - A direct decomposition of 3-connected planar graphs.
JO - Séminaire Lotharingien de Combinatoire [electronic only]
PY - 2005
PB - Universität Wien, Fakultät für Mathematik
VL - 54A
SP - B54Ak, 15 p., electronic only
EP - B54Ak, 15 p., electronic only
LA - eng
KW - random sampling; planar graphs; algorithms
UR - http://eudml.org/doc/227943
ER -

NotesEmbed ?

top

You 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.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.