Exact algorithms to clique-colour graphs

DOI10.1007/978-3-319-04298-5_17MaRDI QIDQ2938100zbMATH OpenOpenAlexFDO

Authors Manfred Cochefert, Dieter Kratsch

Publication date 13 January 2015

Published in SOFSEM 2014: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-04298-5_17

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Coloring the Maximal Cliques of Graphs
• Complexity of clique coloring and related problems
• Structural parameterizations of clique coloring
• scientific article; zbMATH DE number 7559420
• A linear-time algorithm for clique-coloring planar graphs

Cited in

(8)

• Complexity of clique-coloring odd-hole-free graphs
• Reducing graph coloring to clique search
• Complexity of clique coloring and related problems
• scientific article; zbMATH DE number 939919 (Why is no real title available?)
• Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs
• scientific article; zbMATH DE number 7559420 (Why is no real title available?)
• Structural parameterizations of clique coloring
• Exact Algorithms for Coloring Graphs While Avoiding Monochromatic Cycles

This page was built for publication: Exact algorithms to clique-colour graphs

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