Pages that link to "Item:Q2097169"
From MaRDI portal
The following pages link to Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods (Q2097169):
Displaying 11 items.
- Remarks on proper conflict-free colorings of graphs (Q2099465) (← links)
- The odd chromatic number of a planar graph is at most 8 (Q2689111) (← links)
- Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth (Q6080127) (← links)
- On odd colorings of planar graphs (Q6080172) (← links)
- On odd colorings of sparse graphs (Q6145820) (← links)
- A survey on conflict-free connection coloring of graphs (Q6497946) (← links)
- Relaxation of Wegner's planar graph conjecture for maximum degree 4 (Q6611072) (← links)
- Brooks-type theorems for relaxations of square colorings (Q6635100) (← links)
- Proper conflict-free coloring of graphs with large maximum degree (Q6654118) (← links)
- Proper conflict-free coloring of sparse graphs (Q6657259) (← links)
- New bounds for odd colourings of graphs (Q6671589) (← links)
