Unique-maximum and conflict-free coloring for hypergraphs and tree graphs

DOI10.1137/120880471MaRDI QIDQ5408592zbMATH OpenOpenAlexFDO

Authors Panagiotis Cheilaris, Balázs Keszegh, 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

zbMATH Keywords

conflict-free chromatic numberconflict-free coloringgraph coloringhypergraph coloringodd chromatic numberodd coloringunique-maximum chromatic numberunique-maximum coloring

Mathematics Subject Classification ID

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

Recommendations

• Unique-maximum and conflict-free coloring for hypergraphs and tree graphs
• Graph unique-maximum and conflict-free colorings
• Graph unique-maximum and conflict-free colorings
• On variants of conflict-free-coloring for hypergraphs
• Conflict-free colourings of uniform hypergraphs with few edges

Cited in

(39)

• Conflict-free connections of graphs
• On facial unique-maximum (edge-)coloring
• On conflict-free connection of graphs
• Maximizing and minimizing the number of generalized colorings of trees
• Graphs with conflict-free connection number two
• Conflict-free connection number and independence number of a graph
• 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
• Remarks on proper conflict-free colorings of graphs
• Colorings with neighborhood parity condition
• Remarks on odd colorings of graphs
• Conflict-free connection number of random graphs
• Conflict-free vertex connection number at most 3 and size of graphs
• Non-monochromatic and conflict-free colorings on tree spaces and planar network spaces
• Unique-maximum edge-colouring of plane graphs with respect to faces
• Brooks type results for conflict-free colorings and \(\{a, b \}\)-factors in graphs
• Online and quasi-online colorings of wedges and intervals
• Unique-maximum and conflict-free coloring for hypergraphs and tree graphs
• Anagram-free colourings of graphs
• Graph unique-maximum and conflict-free colorings
• Maximum value of conflict-free vertex-connection number of graphs
• scientific article; zbMATH DE number 6982150 (Why is no real title available?)
• Notes on weak-odd edge colorings of digraphs
• Exact and Fixed Parameter Tractable Algorithms for Max-Conflict-Free Coloring in Hypergraphs
• scientific article; zbMATH DE number 7666240 (Why is no real title available?)
• 1-planar graphs are odd 13-colorable
• Conflict-free connection number of graphs with four bridges
• On odd colorings of planar graphs
• Graph unique-maximum and conflict-free colorings
• A survey on conflict-free connection coloring of graphs
• Conflict-free colouring of subsets
• New bounds for odd colourings of graphs
• The conflict-free connection number and the minimum degree-sum of graphs
• Linearly ordered colourings of hypergraphs
• Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs
• Complexity of approximate conflict-free, linearly-ordered, and nonmonochromatic hypergraph colourings
• Unique-maximum coloring of plane graphs
• Maximum edge-colorings of graphs

This page was built for publication: Unique-maximum and conflict-free coloring for hypergraphs and tree graphs

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