The following pages link to 不含3, 4, 8-圈的平面图的2-距离染色 (Q3194464):
Displaying 7 items.
- 2-distance coloring of a planar graph without 3, 4, 7-cycles (Q328716) (← links)
- The \(k\)-distance chromatic number of trees and cycles (Q2293844) (← links)
- 2-distance 4-colorability of planar subcubic graphs with girth at least 22 (Q2906373) (← links)
- r-Hued coloring of planar graphs without short cycles (Q4965904) (← links)
- 2-Distance coloring of planar graphs without short cycles (Q5017763) (← links)
- 2-Distance coloring of planar graphs without triangles and intersecting 4-cycles (Q6174168) (← links)
- The 2-distance chromatic number of planar graphs without 3,4,8-cycles (Q6645214) (← links)
