Complete colourings of hypergraphs

DOI10.1016/j.disc.2019.111673zbMath1429.05065WikidataQ127181455 ScholiaQ127181455MaRDI QIDQ2279996

Paweł Rzążewski, Keith J. Edwards

Publication date: 17 December 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://discovery.dundee.ac.uk/en/publications/000bac83-9e62-456d-b50d-f0c86bbb078b

zbMATH Keywords

hypergraph; achromatic number; complete colouring; strong colouring

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C65: Hypergraphs

05C15: Coloring of graphs and hypergraphs

Related Items

The existence of uniform hypergraphs for which the interpolation property of complete coloring fails, Concepts on coloring of cluster hypergraphs with application

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Concerning the achromatic number of graphs
• The complexity of harmonious colouring for trees
• The achromatic number of bounded degree trees
• Achromatic number is NP-complete for cographs and interval graphs
• Harmonious chromatic number of directed graphs
• Uncolorable mixed hypergraphs
• Colour-critical graphs and hypergraphs
• Achromatic number of fragmentable graphs
• The Harmonious Chromatic Number of Bounded Degree Graphs
• Parameterized Algorithms
• On chromatic number of graphs and set-systems
• Approximation and Online Algorithms
• Harmonious and achromatic colorings of fragmentable hypergraphs