On the lower bound for the chromatic number of graphs with given maximal degree and girth.

Tashkinov, V.A.

Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only] (2004)

  • Volume: 1, page 99-109
  • ISSN: 1813-3304

How to cite

top

Tashkinov, V.A.. "On the lower bound for the chromatic number of graphs with given maximal degree and girth.." Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only] 1 (2004): 99-109. <http://eudml.org/doc/51821>.

@article{Tashkinov2004,
author = {Tashkinov, V.A.},
journal = {Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]},
keywords = {coloring; sparse graph; density},
language = {eng},
pages = {99-109},
publisher = {Institut Matematiki Im. S.L. Soboleva, SO RAN},
title = {On the lower bound for the chromatic number of graphs with given maximal degree and girth.},
url = {http://eudml.org/doc/51821},
volume = {1},
year = {2004},
}

TY - JOUR
AU - Tashkinov, V.A.
TI - On the lower bound for the chromatic number of graphs with given maximal degree and girth.
JO - Sibirskie Ehlektronnye Matematicheskie Izvestiya [electronic only]
PY - 2004
PB - Institut Matematiki Im. S.L. Soboleva, SO RAN
VL - 1
SP - 99
EP - 109
LA - eng
KW - coloring; sparse graph; density
UR - http://eudml.org/doc/51821
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.