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...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 1044; s. 115271
Hlavní autori:	Akhoondian Amiri, Saeed, Popa, Alexandru, Roghani, Mohammad, Shahkarami, Golnoosh, Soltani, Reza, Vahidi, Hossein
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.08.2025
Predmet:	ETH Exact algorithm Graph coloring Hardness of approximation NP-hard ETH NP-hard Graph coloring Exact algorithm Hardness of approximation
ISSN:	0304-3975
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!