Path partitions of planar graphs.

Glebov, A.N.; Zambalaeva, D.Zh.

Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only] (2007)

  • Volume: 4, page 450-459
  • ISSN: 1813-3304

How to cite

top

Glebov, A.N., and Zambalaeva, D.Zh.. "Path partitions of planar graphs.." Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only] 4 (2007): 450-459. <http://eudml.org/doc/53813>.

@article{Glebov2007,
author = {Glebov, A.N., Zambalaeva, D.Zh.},
journal = {Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]},
keywords = {hereditary property; partition problem; kernel of graph; path kernel},
language = {eng},
pages = {450-459},
publisher = {Institut Matematiki Im. S.L. Soboleva, SO RAN},
title = {Path partitions of planar graphs.},
url = {http://eudml.org/doc/53813},
volume = {4},
year = {2007},
}

TY - JOUR
AU - Glebov, A.N.
AU - Zambalaeva, D.Zh.
TI - Path partitions of planar graphs.
JO - Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
PY - 2007
PB - Institut Matematiki Im. S.L. Soboleva, SO RAN
VL - 4
SP - 450
EP - 459
LA - eng
KW - hereditary property; partition problem; kernel of graph; path kernel
UR - http://eudml.org/doc/53813
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.