Decomposing a planar graph into a forest and a subgraph of restricted maximum degree.
Borodin, O.V.; Ivanova, A.O.; Stechkin, B.S.
Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only] (2007)
- Volume: 4, page 296-299
- ISSN: 1813-3304
Access Full Article
top
How to cite
topBorodin, O.V., Ivanova, A.O., and Stechkin, B.S.. "Decomposing a planar graph into a forest and a subgraph of restricted maximum degree.." Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only] 4 (2007): 296-299. <http://eudml.org/doc/53811>.
@article{Borodin2007,
author = {Borodin, O.V., Ivanova, A.O., Stechkin, B.S.},
journal = {Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]},
keywords = {matching; game chromatic number; game coloring number; maximum degree of graph},
language = {eng},
pages = {296-299},
publisher = {Institut Matematiki Im. S.L. Soboleva, SO RAN},
title = {Decomposing a planar graph into a forest and a subgraph of restricted maximum degree.},
url = {http://eudml.org/doc/53811},
volume = {4},
year = {2007},
}
TY - JOUR
AU - Borodin, O.V.
AU - Ivanova, A.O.
AU - Stechkin, B.S.
TI - Decomposing a planar graph into a forest and a subgraph of restricted maximum degree.
JO - Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
PY - 2007
PB - Institut Matematiki Im. S.L. Soboleva, SO RAN
VL - 4
SP - 296
EP - 299
LA - eng
KW - matching; game chromatic number; game coloring number; maximum degree of graph
UR - http://eudml.org/doc/53811
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.