The chromatic number of extended odd graphs is four

Marie Sokolová

Časopis pro pěstování matematiky (1987)

  • Volume: 112, Issue: 3, page 308-311
  • ISSN: 0528-2195

How to cite

top

Sokolová, Marie. "The chromatic number of extended odd graphs is four." Časopis pro pěstování matematiky 112.3 (1987): 308-311. <http://eudml.org/doc/21678>.

@article{Sokolová1987,
author = {Sokolová, Marie},
journal = {Časopis pro pěstování matematiky},
keywords = {odd graph; chromatic number},
language = {eng},
number = {3},
pages = {308-311},
publisher = {Mathematical Institute of the Czechoslovak Academy of Sciences},
title = {The chromatic number of extended odd graphs is four},
url = {http://eudml.org/doc/21678},
volume = {112},
year = {1987},
}

TY - JOUR
AU - Sokolová, Marie
TI - The chromatic number of extended odd graphs is four
JO - Časopis pro pěstování matematiky
PY - 1987
PB - Mathematical Institute of the Czechoslovak Academy of Sciences
VL - 112
IS - 3
SP - 308
EP - 311
LA - eng
KW - odd graph; chromatic number
UR - http://eudml.org/doc/21678
ER -

References

top
  1. F. Harary, Four Difficult Unsolved Problems in Graph Theory, In: M. Fiedler ed.: Recent Advances in Graph Theory. Academia Praha 1975, 249-256. (1975) Zbl0329.05125MR0382042
  2. H. M. Mulder, The interval function of a graph, Mathematisch Centrum. Amsterdam 1980. (1980) Zbl0446.05039MR0605838

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.