A viewpoint to the minimum coloring problem of hypergraphs

U. J. Nieminen

Kybernetika (1974)

  • Volume: 10, Issue: 6, page (504)-508
  • ISSN: 0023-5954

How to cite

top

Nieminen, U. J.. "A viewpoint to the minimum coloring problem of hypergraphs." Kybernetika 10.6 (1974): (504)-508. <http://eudml.org/doc/27478>.

@article{Nieminen1974,
author = {Nieminen, U. J.},
journal = {Kybernetika},
language = {eng},
number = {6},
pages = {(504)-508},
publisher = {Institute of Information Theory and Automation AS CR},
title = {A viewpoint to the minimum coloring problem of hypergraphs},
url = {http://eudml.org/doc/27478},
volume = {10},
year = {1974},
}

TY - JOUR
AU - Nieminen, U. J.
TI - A viewpoint to the minimum coloring problem of hypergraphs
JO - Kybernetika
PY - 1974
PB - Institute of Information Theory and Automation AS CR
VL - 10
IS - 6
SP - (504)
EP - 508
LA - eng
UR - http://eudml.org/doc/27478
ER -

References

top
  1. C. Berge, Graphes et hypergraphes, Dunod, Paris 1970. (1970) Zbl0213.25702MR0357173
  2. P. L. Hammer S. Rudeanu, Boolean methods in operations research and related areas, Springer-Verlag, Berlin-Heidelberg-New York 1968. (1968) MR0235830

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.