Asymptotically optimal frugal colouring

MaRDI QIDQ4633816zbMATH OpenFDO

Authors Michael Molloy, Bruce Reed

Publication date 6 May 2019

Full work available at URL https://dl.acm.org/citation.cfm?id=1496782

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Asymptotically optimal frugal colouring
• Colouring a graph frugally
• Coloring graphs with sparse neighborhoods
• Total Coloring With \Delta + \mbox\lowercasepoly(\log \Delta) Colors
• Frugal, acyclic and star colourings of graphs

Cited in

(8)

• Colouring a graph frugally
• The complexity of frugal colouring
• Optimal bounds for the colored Tverberg problem
• Intersection dimension and maximum degree
• On the greatest number of 2 and 3 colorings of a (v, e)-graph
• Counting colorings of triangle-free graphs
• Frugal, acyclic and star colourings of graphs
• Asymptotically optimal frugal colouring

This page was built for publication: Asymptotically optimal frugal colouring

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