Pages that link to "Item:Q1294064"
From MaRDI portal
The following pages link to Upper bounds of entire chromatic number of plane graphs (Q1294064):
Displaying 15 items.
- The entire choosability of plane graphs (Q266053) (← links)
- Entire colouring of plane graphs (Q651038) (← links)
- A bound on the chromatic number of an almost planar graph (Q744556) (← links)
- Entire chromatic number and \(\Delta\)-matching of outerplane graphs (Q815128) (← links)
- Upper bound on the circular chromatic number of the plane (Q1753019) (← links)
- Plane graphs with \(\Delta = 7\) are entirely 10-colorable (Q2185811) (← links)
- The entire coloring of series-parallel graphs (Q2577645) (← links)
- Plane graphs with maximum degree 9 are entirely 11-choosable (Q2629286) (← links)
- Entire \((\varDelta +2)\)-colorability of plane graphs (Q2637243) (← links)
- Entire coloring of 2-connected plane graphs (Q2662784) (← links)
- A characterization of the entire chromatic number of plane graphs with high maximum degree (Q2721791) (← 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)
- Upper chromatic number of finite projective planes (Q3503598) (← links)
- Structural theorem on plane graphs with application to the entire coloring number (Q4715277) (← links)
