Pages that link to "Item:Q1613467"
From MaRDI portal
The following pages link to A 4-colour problem for dense triangle-free graphs (Q1613467):
Displaying 19 items.
- Acyclically 4-colorable triangulations (Q264190) (← links)
- On degree sums of a triangle-free graph (Q465274) (← links)
- Colouring vertices of triangle-free graphs without forests (Q764907) (← links)
- On the structure of triangle-free graphs of large minimum degree (Q858147) (← links)
- Triangle-free graphs whose independence number equals the degree (Q960981) (← links)
- Diameter of 4-colourable graphs (Q1024307) (← links)
- Degree sequences in triangle-free graphs (Q1182926) (← links)
- Another infinite sequence of dense triangle-free graphs (Q1266753) (← links)
- On the chromatic number of triangle-free graphs of large minimum degree (Q1410410) (← links)
- A coloring algorithm for \(4 K_1\)-free line graphs (Q1686052) (← links)
- A sufficient condition for DP-4-colorability (Q1752670) (← links)
- Triangle-free four-chromatic graphs (Q1901038) (← links)
- Some properties of non-bicolorable hypergraphs and the four-color problem (Q1917261) (← links)
- Triangle-free graphs with large chromatic numbers (Q1969797) (← links)
- Bipartite induced density in triangle-free graphs (Q2185224) (← links)
- On the Structure of Graphs with Given Odd Girth and Large Minimum Degree (Q2947860) (← links)
- Colouring Vertices of Triangle-Free Graphs (Q3057624) (← links)
- On the density of 2-colorable 3-graphs in which any four points span at most two edges (Q3576967) (← links)
- (Q3724376) (← links)