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

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 1054; p. 115482
Main Authors:	Wu, Yali, Zhang, Xin
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 03.11.2025
Subjects:	Fast algorithm Mycielskian Proper conflict-free coloring Fast algorithm Proper conflict-free coloring Mycielskian
ISSN:	0304-3975
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!