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

Uloženo v:
Podrobná bibliografie
Vydáno v:Theoretical computer science Ročník 1054; s. 115482
Hlavní autoři: Wu, Yali, Zhang, Xin
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 03.11.2025
Témata:
Fast algorithm
Mycielskian
Proper conflict-free coloring
Fast algorithm
Proper conflict-free coloring
Mycielskian
ISSN:0304-3975
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 applications in networking, geographic information systems, scheduling, and constraint satisfaction problems. Caro, Petruševski, and Škrekovski conjectured in 2023 that every graph with maximum degree Δ≥3 has a PCF-(Δ+1)-coloring. In this paper, we validate this conjecture for the Mycielskians of 1-subdivided graphs. Additionally, we determine the PCF-chromatic number for Mycielskians of paths, cycles, complete graphs, complete bipartite graphs, and wheels, and provide efficient algorithms that produce optimal PCF-colorings for these graphs.
ISSN:0304-3975
DOI:10.1016/j.tcs.2025.115482