Problems on fully irregular digraphs
Zdzisław Skupień
Discussiones Mathematicae Graph Theory, Tome 19 (1999), p. 253-255 / Harvested from The Polish Digital Mathematics Library
Publié le : 1999-01-01
EUDML-ID : urn:eudml:doc:270285
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1102,
     author = {Zdzis\l aw Skupie\'n},
     title = {Problems on fully irregular digraphs},
     journal = {Discussiones Mathematicae Graph Theory},
     volume = {19},
     year = {1999},
     pages = {253-255},
     zbl = {0954.05503},
     language = {en},
     url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1102}
}
Zdzisław Skupień. Problems on fully irregular digraphs. Discussiones Mathematicae Graph Theory, Tome 19 (1999) pp. 253-255. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1102/

[000] [1] Z. Dziechcińska-Halamoda, Z. Majcher, J. Michael, and Z. Skupień, Sets of degree pairs in the extremum fully irregular digraphs, in preparation. | Zbl 1142.05325

[001] [2] J. Górska, Z. Skupień, Z. Majcher, and J. Michael, A smallest fully irregular oriented graph containing a given diregular one, submitted. | Zbl 1051.05045

[002] [3] J. Górska and Z. Skupień, A smallest fully irregular digraph containing a given diregular one, in preparation. | Zbl 1051.05045

[003] [4] F. Harary and E.M. Palmer, Graphical Enumeration (Academic Press, New York, 1973). | Zbl 0266.05108

[004] [5] Z. Majcher, J. Michael, J. Górska, and Z. Skupień, The minimum size of fully irregular oriented graphs, in: Proc. Kazimierz Dolny '97 Conf., Discrete Math., to appear. | Zbl 0998.05028