On graphs with restricted link graphs and the chromatic number at most
Časopis pro pěstování matematiky (1988)
- Volume: 113, Issue: 3, page 225-231
- ISSN: 0528-2195
Access Full Article
top
How to cite
topBielak, Halina. "On graphs with restricted link graphs and the chromatic number at most $3$." Časopis pro pěstování matematiky 113.3 (1988): 225-231. <http://eudml.org/doc/19611>.
@article{Bielak1988,
author = {Bielak, Halina},
journal = {Časopis pro pěstování matematiky},
keywords = {j-link; chromatic number},
language = {eng},
number = {3},
pages = {225-231},
publisher = {Mathematical Institute of the Czechoslovak Academy of Sciences},
title = {On graphs with restricted link graphs and the chromatic number at most $3$},
url = {http://eudml.org/doc/19611},
volume = {113},
year = {1988},
}
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
PB - Mathematical Institute of the Czechoslovak Academy of Sciences
VL - 113
IS - 3
SP - 225
EP - 231
LA - eng
KW - j-link; chromatic number
UR - http://eudml.org/doc/19611
ER -
References
top- 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. (1981) MR0818269
- 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. (1982) MR0737056
NotesEmbed ?
topYou 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.