A Construction of Graphs without Triangles having Pre-Assigned Order and Chromatic Number
From MaRDI portal
Recommendations
Cited in
(18)- 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
- Extremal triangle-free and odd-cycle-free colourings of uncountable graphs
- The chromatic number of infinite graphs - A survey
- A note on the Engelking-Karłowicz theorem
- The chromatic number of finite type-graphs
- A note on chromatic number and connectivity of infinite graphs
- Shift graphs on precompact families of finite sets of natural numbers
- Properties of Descartes' Construction of Triangle-Free Graphs with High Chromatic Number
- On chromatic number of graphs and set-systems
- Zur Geometrie der Kreislagerungen
- On decomposition of graphs
- scientific article; zbMATH DE number 2369587 (Why is no real title available?)
- Infinite cliques in simple and stable graphs
- What must and what need not be contained in a graph of uncountable chromatic number?
This page was built for publication: A Construction of Graphs without Triangles having Pre-Assigned Order and Chromatic Number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3276326)
