On good characterizations for digraphs
Časopis pro pěstování matematiky, Tome 111 (1986) no. 4, pp. 424-430
Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
MR ZblKomárek, Pavel. On good characterizations for digraphs. Časopis pro pěstování matematiky, Tome 111 (1986) no. 4, pp. 424-430. doi: 10.21136/CPM.1986.118289
@article{10_21136_CPM_1986_118289,
author = {Kom\'arek, Pavel},
title = {On good characterizations for digraphs},
journal = {\v{C}asopis pro p\v{e}stov\'an{\'\i} matematiky},
pages = {424--430},
year = {1986},
volume = {111},
number = {4},
doi = {10.21136/CPM.1986.118289},
mrnumber = {871717},
zbl = {0609.05040},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.21136/CPM.1986.118289/}
}
[1] F. Harary R. Z. Norman D. Cartwright: Structural Models: Аn Introduction to the Theoгy of Directed Graphs. John Wiley&Sons, Inc, 1965. | MR
[2] P. Komárek: Some New Good Characterizations for Directed Graphs. Čas. pěst. mat. 109 (1984), 348-354. | MR
[3] J. Nesetřil: Theory of Graphs. (Czech), Praha, SNTL (1979).
[4] J. Nešetřil A. Pultr: On Classes of Graphs Determined by Factoг Objects and Subobjects. Discrete Math. 22 (1978), s. 287-300. | MR
Cité par Sources :