Previous |  Up |  Next

Article

Title: On graphs with restricted link graphs and the chromatic number at most $3$ (English)
Title: O grafech se speciálními spojovými grafy s chromatickým číslem rovným nejvýše třem (Czech)
Author: Bielak, Halina
Language: English
Journal: Časopis pro pěstování matematiky
ISSN: 0528-2195
Volume: 113
Issue: 3
Year: 1988
Pages: 225-231
Summary lang: English
Summary lang: Czech
Summary lang: Russian
.
Category: math
.
MSC: 05C99
idZBL: Zbl 0655.05057
idMR: MR960759
DOI: 10.21136/CPM.1988.108781
.
Date available: 2009-09-23T09:47:25Z
Last updated: 2020-07-28
Stable URL: http://hdl.handle.net/10338.dmlcz/108781
.
Reference: [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 0818269
Reference: [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 0737056
.

Files

Files Size Format View
CasPestMat_113-1988-3_1.pdf 987.2Kb application/pdf View/Open
Back to standard record
Partner of
EuDML logo