Pages that link to "Item:Q744556"
From MaRDI portal
The following pages link to A bound on the chromatic number of an almost planar graph (Q744556):
Displaying 6 items.
- On graphs, which can be drawn on an orientable surface with small number of intersections on an edge (Q291177) (← links)
- Upper bounds of entire chromatic number of plane graphs (Q1294064) (← links)
- A tighter bounding interval for the 1-chromatic number of a surface (Q1357725) (← links)
- A dualistic approach to bounding the chromatic number of a graph (Q2462336) (← links)
- New upper bound on the chromatic number of the square of a planar graph (Q2824258) (← links)
- An upper bound of linear chromatic number of planar graphs (Q2916456) (← links)