Bounded Max-colorings of Graphs

DOI10.1007/978-3-642-17517-6_32MaRDI QIDQ3060747zbMATH OpenOpenAlexFDO

Authors Alexander Kononov, G. Lucarelli, Ioannis Milis, Evripidis Bampis

Publication date 9 December 2010

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-17517-6_32

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25)

Recommendations

• Bounded max-colorings of graphs
• Bounded vertex colorings of graphs
• Maximal edge-colorings of graphs
• Bounded colorings of multipartite graphs and hypergraphs
• Maximum edge-colorings of graphs
• Colouring graphs with bounded generalized colouring number
• On the maximum number of colorings of a graph
• An upper bound for total colouring of graphs
• Bounded colorings of outerplanar graphs
• On the coloring of maximal planar graphs

Cited in

(13)

• Sparse \(H\)-colourable graphs of bounded maximum degree
• Maximal ambiguously \(k\)-colorable graphs
• Clique partitioning with value-monotone submodular cost
• Bounded max-colorings of graphs
• The \(r\)-coloring and maximum stable set problem in hypergraphs with bounded matching number and edge size
• Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
• Saving colors and max coloring: some fixed-parameter tractability results
• Max-coloring paths: tight bounds and extensions
• The complexity of changing colourings with bounded maximum degree
• Some new bounds for the maximum number of vertex colorings of a (v,e)-graph
• Max-coloring paths: tight bounds and extensions
• Automata, Languages and Programming
• Bounded vertex colorings of graphs

This page was built for publication: Bounded Max-colorings of Graphs

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