The following pages link to On the Entire Coloring Conjecture (Q4487056):
Displaying 15 items.
- The entire choosability of plane graphs (Q266053) (← links)
- A note on entire choosability of plane graphs (Q423943) (← links)
- Entire colouring of plane graphs (Q651038) (← links)
- Entire coloring of plane graph with maximum degree eleven (Q740657) (← links)
- Entire choosability of near-outerplane graphs (Q1025470) (← links)
- Entire coloring of graphs embedded in a surface of nonnegative characteristic (Q1756114) (← links)
- Plane graphs with \(\Delta = 7\) are entirely 10-colorable (Q2185811) (← links)
- The entire chromatic number of graphs embedded on the torus with large maximum degree (Q2402264) (← 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)
- Plane Graphs with Maximum Degree Are Entirely ‐Colorable (Q5325942) (← links)
- Coupled choosability of plane graphs (Q5387055) (← links)
- Simultaneous coloring of vertices and incidences of outerplanar graphs (Q6109789) (← links)
