Pages that link to "Item:Q907833"
From MaRDI portal
The following pages link to Unique-maximum coloring of plane graphs (Q907833):
Displaying 14 items.
- Conflict-free connections of graphs (Q1656907) (← links)
- On facial unique-maximum (edge-)coloring (Q1701086) (← links)
- A counterexample to a conjecture on facial unique-maximal colorings (Q1701103) (← links)
- Conflict-free connection number and independence number of a graph (Q2025169) (← links)
- Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods (Q2097169) (← links)
- Remarks on proper conflict-free colorings of graphs (Q2099465) (← links)
- Colorings with neighborhood parity condition (Q2172422) (← links)
- Remarks on odd colorings of graphs (Q2172423) (← links)
- A survey on the cyclic coloring and its relaxations (Q2214302) (← links)
- Facial unique-maximum colorings of plane graphs with restriction on big vertices (Q2312801) (← links)
- Facially-constrained colorings of plane graphs: a survey (Q2401805) (← links)
- Facial unique-maximum edge and total coloring of plane graphs (Q2659070) (← links)
- (Q4558068) (← links)
- 1-planar graphs are odd 13-colorable (Q6041551) (← links)
