Voir la notice de l'article provenant de la source Czech Digital Mathematics Library
Bielak, Halina. On graphs with restricted link graphs and the chromatic number at most $3$. Časopis pro pěstování matematiky, Tome 113 (1988) no. 3, pp. 225-231. doi: 10.21136/CPM.1988.108781
@article{10_21136_CPM_1988_108781,
author = {Bielak, Halina},
title = {On graphs with restricted link graphs and the chromatic number at most $3$},
journal = {\v{C}asopis pro p\v{e}stov\'an{\'\i} matematiky},
pages = {225--231},
year = {1988},
volume = {113},
number = {3},
doi = {10.21136/CPM.1988.108781},
mrnumber = {960759},
zbl = {0655.05057},
language = {en},
url = {http://geodesic.mathdoc.fr/articles/10.21136/CPM.1988.108781/}
}
TY - JOUR AU - Bielak, Halina TI - On graphs with restricted link graphs and the chromatic number at most $3$ JO - Časopis pro pěstování matematiky PY - 1988 SP - 225 EP - 231 VL - 113 IS - 3 UR - http://geodesic.mathdoc.fr/articles/10.21136/CPM.1988.108781/ DO - 10.21136/CPM.1988.108781 LA - en ID - 10_21136_CPM_1988_108781 ER -
%0 Journal Article %A Bielak, Halina %T On graphs with restricted link graphs and the chromatic number at most $3$ %J Časopis pro pěstování matematiky %D 1988 %P 225-231 %V 113 %N 3 %U http://geodesic.mathdoc.fr/articles/10.21136/CPM.1988.108781/ %R 10.21136/CPM.1988.108781 %G en %F 10_21136_CPM_1988_108781
[1] L. Szamkolowicz: On a classification of graphs with respect to the properties of neighbourhood graphs. Proc. of Combinatorics Conference (Eger, 1981). Finite and Infìnite Sets (A. Hajnal, L. Lovasz, V. T. Sos, eds.), Coll. Math. Soc. J. Bolyai, vol. 37, North-Holland, Amsterdam, Oxford, New York, 1984, 675-678. | MR
[2] L. Szamkolowicz: On a conjecture concerning the classification of graphs with respect to the properties of neighbourhood gгaphs. Proc. of the Third Czechoslovak Symposium on Graph Theory (Praha, 1982), Teubner-Texte zur Mathematik, 1983, 307-311. | MR
Cité par Sources :