On k-strong conflict-free multicoloring

DOI10.1007/978-3-319-71147-8_19MaRDI QIDQ1708616zbMATH OpenOpenAlexFDO

Authors Luisa Gargano, Adele A. Rescigno, Ugo Vaccaro

Publication date 26 March 2018

Full work available at URL https://doi.org/10.1007/978-3-319-71147-8_19

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65) Programming involving graphs or networks (90C35)

Recommendations

• On conflict-free multi-coloring
• Conflict-free colourings of graphs and hypergraphs
• On variants of conflict-free-coloring for hypergraphs
• Exact and FPT algorithms for MAX-conflict free coloring in hypergraphs
• Strong conflict-free coloring for intervals

Cited in

(7)

• Low-weight superimposed codes and related combinatorial structures: bounds and applications
• On conflict-free multi-coloring
• Conflict-free colourings of graphs and hypergraphs
• Strong conflict-free coloring for intervals
• On variants of conflict-free-coloring for hypergraphs
• A survey of cover-free families: constructions, applications, and generalizations
• Improved bounds for group testing in arbitrary hypergraphs

This page was built for publication: On \(k\)-strong conflict-free multicoloring

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