Conflict-free chromatic index of trees

A graph $G$ is conflict-free $k$-edge-colorable if there exists an assignment of $k$ colors to $E(G)$ such that for every edge $e\in E(G)$, there is a color that is assigned to exactly one edge among the closed neighborhood of $e$. The smallest $k$ such that $G$ is conflict-free $k$-edge-colorable i...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Guo, Shanshan, Li, Ethan Y. H, Li, Luyi, Li, Ping
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Discrete Mathematics Mathematics - Combinatorics
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!