The following pages link to (Q5277036):
Displaying 8 items.
- A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five (Q520529) (← links)
- A linear-time algorithm for 7-coloring 1-plane graphs (Q818664) (← links)
- 1-planar graphs without 4-cycles or 5-cycles are 5-colorable (Q2115229) (← links)
- A note on 1-planar graphs with minimum degree 7 (Q2217475) (← links)
- A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable (Q2359791) (← links)
- 不含3圈和4圈的1-平面图是5-可染的 (Q3131939) (← links)
- 1-planar graphs are odd 13-colorable (Q6041551) (← links)
- 1-planar graphs with girth at least 6 are (1,1,1,1)-colorable (Q6137013) (← links)
