Circular chromatic number: a survey
By Xuding Zhu. Discrete Mathematics, 2001
387 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/a16f37a82314bbe56ccb49d864546151ddb483ff
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
Citations in the corpus
- NP completeness of the edge precoloring extension problem on bipartite graphs (2003, methodology): “, [9]).”
- Edge colorings of complete graphs without tricolored triangles (2004, neutral): “, in [10].”
- All (k;g)-cages are k-edge-connected (2005, neutral): “The circular chromatic number of a graph has a few equivalent definitions [8].”