Pages that link to "Item:Q1679905"
From MaRDI portal
The following pages link to NP-completeness of local colorings of graphs (Q1679905):
Displaying 8 items.
- Locally injective \(k\)-colourings of planar graphs (Q400498) (← links)
- A note on local coloring of graphs (Q477670) (← links)
- Deterministic local algorithms, unique identifiers, and fractional graph colouring (Q896700) (← links)
- On the complexity of graph coloring with additional local conditions (Q1708276) (← links)
- The local nature of \(\Delta\)-coloring and its algorithmic applications (Q1894705) (← links)
- Locality of not-so-weak coloring (Q2303281) (← links)
- The NP-completeness of authomorphic colorings (Q2997596) (← links)
- NP-Completeness of Spreading Colored Points (Q3066143) (← links)