scientific article; zbMATH DE number 6315447
From MaRDI portal
Publication:5167097
zbMATH Open1301.05140MaRDI QIDQ5167097
Publication date: 9 July 2014
Title of this publication is not available (Why is that?)
graph coloringNP-complete problemsmaximum cliquemaximal clique\(k\)-cliquecoloring the nodescoloring the edges
Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (5)
Complexity of vertex switching on edge-bicolored graphs ⋮ Title not available (Why is that?) ⋮ Some undecidable problems involving the edge-coloring and vertex-coloring of graphs ⋮ Randomized Δ-edge colouring via exchanges of complex colours ⋮ On the computational complexity of strong edge coloring
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5167097)
