Pages that link to "Item:Q4405185"
From MaRDI portal
The following pages link to A (<5)-Colour Theorem for Planar Graphs (Q4405185):
Displayed 11 items.
- BCH codes and distance multi- or fractional colorings in hypercubes asymptotically (Q868374) (← links)
- The fractional chromatic number, the Hall ratio, and the lexicographic product (Q1044943) (← links)
- The complexity of multicolouring (Q1113919) (← links)
- Multicolorings, measures and games on graphs (Q1226495) (← links)
- Set colourings of graphs (Q1255964) (← links)
- On the fractional chromatic number and the lexicographic product of graphs (Q1584257) (← links)
- NP-completeness of a family of graph-colouring problems (Q1835680) (← links)
- The \(k\)-fractal of a simplicial complex (Q1877647) (← links)
- Independent sets in triangle-free cubic planar graphs (Q2490253) (← links)
- Set colourings of graphs. (Reprint) (Q2497995) (← links)
- A Three and Five Color Theorem (Q4404921) (← links)