Complexity of computing the anti-Ramsey numbers for paths

The anti-Ramsey numbers are a fundamental notion in graph theory, introduced in 1978, by Erdős, Simonovits and Sós. For given graphs G and H the anti-Ramsey numberar(G,H) is defined to be the maximum number k such that there exists an assignment of k colors to the edges of G in which every copy of H...

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 1044; p. 115271
Main Authors:	Akhoondian Amiri, Saeed, Popa, Alexandru, Roghani, Mohammad, Shahkarami, Golnoosh, Soltani, Reza, Vahidi, Hossein
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.08.2025
Subjects:	ETH Exact algorithm Graph coloring Hardness of approximation NP-hard ETH NP-hard Graph coloring Exact algorithm Hardness of approximation
ISSN:	0304-3975
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!