Star Colouring of Bounded Degree Graphs and Regular Graphs

A \(k\)-star colouring of a graph \(G\) is a function \(f:V(G)\to\{0,1,\dots,k-1\}\) such that \(f(u)\neq f(v)\) for every edge \(uv\) of \(G\), and every bicoloured connected subgraph of \(G\) is a star. The star chromatic number of \(G\), \(\chi_s(G)\), is the least integer \(k\) such that \(G\) i...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2023-09
Hauptverfasser:	Shalu, M A, Cyriac Antony
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Apexes Coloring Graph theory Graphs Lower bounds Mathematics - Combinatorics
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!