From NMNR-coloring of hypergraphs to homogenous coloring of graphs

DOI10.26493/1855-3974.1083.54FMaRDI QIDQ5357311zbMATH OpenOpenAlexWikidataFDO

Authors Mária Janicová, Tomáš Madaras, Roman Soták, Borut Lužar

Publication date 14 September 2017

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL https://doi.org/10.26493/1855-3974.1083.54f

zbMATH Keywords

bi-hypergraphhomogenous coloringmixed hypergraphNMNR-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Hypergraphs (05C65)

Recommendations

• Hom complexes and hypergraph colorings
• Color refinement, homomorphisms, and hypergraphs
• Colorings of hypergraphs
• ON HYPERGRAPH COLOURINGS
• scientific article; zbMATH DE number 2156263
• Coloring nearly-disjoint hypergraphs with \(n + o(n)\) colors
• On proper colorings of hypergraphs
• Homogeneous edge-colorings of graphs
• Publication:4862342
• Coloring H-free hypergraphs

Cited in

(4)

• Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods
• Non-monochromatic non-rainbow colourings of -hypergraphs
• Edge homogeneous colorings
• Homogeneous colourings of graphs

This page was built for publication: From NMNR-coloring of hypergraphs to homogenous coloring of graphs

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