The following pages link to (Q4715277):
Displayed 10 items.
- On doubly light triangles in plane graphs (Q383767) (← links)
- Every 3-polytope with minimum degree 5 has a 6-cycle with maximum degree at most 11 (Q393180) (← links)
- Upper bounds on the linear chromatic number of a graph (Q626759) (← links)
- Entire colouring of plane graphs (Q651038) (← links)
- Edge-partitions of graphs of nonnegative characteristic and their game coloring numbers (Q819816) (← links)
- The edge-face choosability of plane graphs (Q1883606) (← links)
- The entire coloring of series-parallel graphs (Q2577645) (← links)
- Entire \((\varDelta +2)\)-colorability of plane graphs (Q2637243) (← links)
- <i>M</i>-degrees of quadrangle-free planar graphs (Q3605161) (← links)
- Plane Graphs with Maximum Degree Are Entirely ‐Colorable (Q5325942) (← links)