Proper conflict-free coloring of Mycielskians with fast algorithms

A proper conflict-free coloring, often termed as PCF-coloring, of a graph refers to a proper vertex coloring wherein each vertex's open neighborhood contains at least one color appearing exactly once. PCF-coloring boasts a wide range of applications, from theoretical graph analysis to practical...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 1054; s. 115482
Hlavní autori:	Wu, Yali, Zhang, Xin
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 03.11.2025
Predmet:	Fast algorithm Mycielskian Proper conflict-free coloring Fast algorithm Proper conflict-free coloring Mycielskian
ISSN:	0304-3975
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!