A Construction of Graphs without Triangles having Pre-Assigned Order and Chromatic Number
From MaRDI portal
Publication:3276326
DOI10.1112/jlms/s1-35.4.445zbMath0097.16402MaRDI QIDQ3276326
Publication date: 1960
Published in: Journal of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/jlms/s1-35.4.445
Related Items
On chromatic number of graphs and set-systems, Zur Geometrie der Kreislagerungen, On decomposition of graphs, What must and what need not be contained in a graph of uncountable chromatic number?, Cycles in graphs of uncountable chromatic number, Some perfect coloring properties of graphs, Compactness and finite equivalence of infinite digraphs, Sets in a Euclidean space which are not a countable union of convex subsets, On Taylor's problem