Complexity of computing the anti-Ramsey numbers for paths

DOI10.1016/J.TCS.2025.115271MaRDI QIDQ6985811zbMATH OpenFDO

Authors Saeed Akhoondian Amiri, Alexandru Popa, Mohammad Roghani, Golnoosh Shahkarami, Reza Soltani, Hossein Vahidi

Publication date 12 May 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

exact algorithmgraph coloringNP-hardnesshardness of approximationETH

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

This page was built for publication: Complexity of computing the anti-Ramsey numbers for paths

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