The complexity of an exotic edge coloring of graphs

MaRDI QIDQ5167097zbMATH OpenFDO

Authors Sándor Szabó

Publication date 9 July 2014

zbMATH Keywords

\(k\)-cliquecoloring the edgescoloring the nodesgraph coloringmaximal cliquemaximum cliqueNP-complete problems

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Edge coloring of graphs, uses, limitation, complexity
• Reducing graph coloring to clique search
• Decomposing clique search problems into smaller instances based on node and edge colorings
• Coloring the nodes of a directed graph
• scientific article; zbMATH DE number 1998816

Cited in

(9)

• On the computational complexity of strong edge coloring
• Decomposing clique search problems into smaller instances based on node and edge colorings
• Complexity of vertex switching on edge-bicolored graphs
• Coloring the edges of a directed graph
• Edge coloring of graphs, uses, limitation, complexity
• Randomized Δ-edge colouring via exchanges of complex colours
• Coloring the nodes of a directed graph
• scientific article; zbMATH DE number 7407404 (Why is no real title available?)
• Some undecidable problems involving the edge-coloring and vertex-coloring of graphs

This page was built for publication: The complexity of an exotic edge coloring of graphs

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