Pages that link to "Item:Q456289"

The following pages link to Locally identifying coloring of graphs (Q456289):

Displaying 15 items.

• Inapproximability of the lid-chromatic number (Q324747) (← links)
• Relaxed locally identifying coloring of graphs (Q343700) (← links)
• Locally identifying colourings for graphs with given maximum degree (Q418899) (← links)
• On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs (Q730489) (← links)
• Deterministic local algorithms, unique identifiers, and fractional graph colouring (Q896700) (← links)
• Locally identifying coloring of graphs with few P4s (Q1685965) (← links)
• Locality of not-so-weak coloring (Q2303281) (← links)
• A Vizing-like theorem for union vertex-distinguishing edge coloring (Q2410224) (← links)
• Locally identifying coloring in bounded expansion classes of graphs (Q2446886) (← links)
• Locating-Domination and Identification (Q3384611) (← links)
• (Q4811984) (← links)
• Identifiability of Graphs with Small Color Classes by the Weisfeiler-Leman Algorithm (Q5874317) (← links)
• On locally identifying coloring of graphs (Q6132530) (← links)
• On locally identifying coloring of Cartesian product and tensor product of graphs (Q6611088) (← links)
• Optimal local identifying and local locating-dominating codes (Q6614544) (← links)