The following pages link to (Q4278795):
Displaying 9 items.
- Plane graphs with maximum degree 6 are edge-face 8-colorable (Q742598) (← links)
- On the \(d\)-distance face chromatic number of plane graphs (Q1356701) (← links)
- The edge-face choosability of plane graphs with maximum degree at least 9 (Q2449158) (← links)
- A characterization of the entire chromatic number of plane graphs with high maximum degree (Q2721791) (← links)
- (Q4019911) (← links)
- Structural theorem on plane graphs with application to the entire coloring number (Q4715277) (← links)
- On the vertex face total chromatic number of planar graphs (Q4879164) (← links)
- Edge-face total chromatic number of outerplanar graphs with Δ (G)=6 (Q6085733) (← links)
- An improved upper bound on the edge-face coloring of 2-connected plane graphs (Q6611726) (← links)