Locality of not-so-weak coloring

DOI10.1007/978-3-030-24922-9_3MaRDI QIDQ2303281zbMATH OpenOpenAlexFDO

Authors Alkida Balliu, Juho Hirvonen, Christoph Lenzen, Dennis Olivetti, Jukka Suomela

Publication date 3 March 2020

Full work available at URL https://arxiv.org/abs/1904.05627

Mathematics Subject Classification ID

Computer system organization (68Mxx) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• scientific article; zbMATH DE number 2188610
• On locally-perfect colorings
• A note on local coloring of graphs
• On the local colorings of graphs
• A note on local colorings of graphs
• Local coloring: new observations and new reductions
• Locally restricted colorings
• NP-completeness of local colorings of graphs
• Locally identifying coloring of graphs
• On locally identifying coloring of graphs

Cited in

(7)

• Local mending
• Linial for lists
• Distributed (+1)-coloring via ultrafast graph shattering
• Hardness of Minimal Symmetry Breaking in Distributed Computing
• Local approximation of the maximum cut in regular graphs
• Local conflict coloring revisited: Linial for lists
• Brief announcement: Simpler and more general distributed coloring based on simple list defective coloring algorithms

This page was built for publication: Locality of not-so-weak coloring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2303281)