Pages that link to "Item:Q418899"
From MaRDI portal
The following pages link to Locally identifying colourings for graphs with given maximum degree (Q418899):
Displaying 7 items.
- Inapproximability of the lid-chromatic number (Q324747) (← links)
- Relaxed locally identifying coloring of graphs (Q343700) (← links)
- Extension of universal cycles for globally identifying colorings of cycles (Q526222) (← links)
- On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs (Q730489) (← links)
- Locally identifying coloring of graphs with few P4s (Q1685965) (← links)
- Locally identifying coloring in bounded expansion classes of graphs (Q2446886) (← links)
- On locally identifying coloring of graphs (Q6132530) (← links)