Edge coloring of graphs, uses, limitation, complexity

DOI10.1515/ausi-2016-0004zbMath1339.05148OpenAlexW2474458879MaRDI QIDQ2629566

Sándor Szabó, Bogdán Zaválnij

Publication date: 6 July 2016

Published in: Acta Universitatis Sapientiae. Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1515/ausi-2016-0004

zbMATH Keywords

edge coloringcliquevertex coloringmaximum cliquemaximal cliqueclique search algorithms

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An exact algorithm for the maximum clique problem
• Test case generators and computational results for the maximum clique problem
• Sur le coloriage des graphs

This page was built for publication: Edge coloring of graphs, uses, limitation, complexity