\(T\)-colorings, divisibility and the circular chromatic number

DOI10.7151/dmgt.2198OpenAlexW2908876789WikidataQ128522301 ScholiaQ128522301MaRDI QIDQ2227106

Krzysztof Turowski, Anna Maria Trzaskowska, Robert Janczewski

Publication date: 10 February 2021

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2198

zbMATH Keywords

circular chromatic number\(T\)-coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• \(T\)-coloring on folded hypercubes
• Greedy \(T\)-colorings of graphs
• The complexity of the \(T\)-coloring problem for graphs with small degree
• A polynomial algorithm for finding \(T\)-span of generalized cacti
• The edge span of T-coloring on graph \(C^{d}_{n}\)
• Star chromatic number
• Further Results on T-Coloring and Frequency Assignment Problems
• The star-chromatic number of planar graphs
• Circular chromatic number and Mycielski graphs
• Circular chromatic number: A survey
• Divisibility and \(T\)-span of graphs

This page was built for publication: \(T\)-colorings, divisibility and the circular chromatic number