Unique-Maximum and Conflict-Free Coloring for Hypergraphs and Tree Graphs
From MaRDI portal
Publication:5408592
DOI10.1137/120880471zbMath1292.05107OpenAlexW2070040189MaRDI QIDQ5408592
Balázs Keszegh, Panagiotis Cheilaris, Dömötör Pálvölgyi
Publication date: 10 April 2014
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: http://real.mtak.hu/15173/1/cfumhyptjsiam.pdf
graph coloringhypergraph coloringconflict-free coloringunique-maximum coloringodd coloringodd chromatic numberconflict-free chromatic numberunique-maximum chromatic number
Related Items
Anagram-Free Colourings of Graphs, Maximum value of conflict-free vertex-connection number of graphs, Conflict-free connections of graphs, Colorings with neighborhood parity condition, Remarks on odd colorings of graphs, Notes on weak-odd edge colorings of digraphs, 1-planar graphs are odd 13-colorable, Conflict-free connection number of graphs with four bridges, On odd colorings of planar graphs, Conflict-free connection number of random graphs, On facial unique-maximum (edge-)coloring, Unique-maximum coloring of plane graphs, Maximum edge-colorings of graphs, Unnamed Item, On conflict-free connection of graphs, Maximizing and minimizing the number of generalized colorings of trees, Conflict-free vertex connection number at most 3 and size of graphs, Graphs with conflict-free connection number two, Unnamed Item, Conflict-free connection number and independence number of a graph, Online and quasi-online colorings of wedges and intervals, Conflict-free connection number and size of graphs, Conflict-free connection of trees, Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods, Unique-maximum edge-colouring of plane graphs with respect to faces, Remarks on proper conflict-free colorings of graphs
