2001/08/27 by Claude Tardif · 2 citations
Computer Science · Mathematics · #Topological and Geometric Data Analysis #Advanced Topology and Set Theory #Limits and Structures in Graph Theory #Chromatic scale #Mathematics #Combinatorics #Graph #Graph theory #Discrete mathematics
paper · doi:10.1002/jgt.1025
openalex publication_date 2001/08/27 · openalex created_date 2016/06/24 · openalex updated_date 2026/07/28
Abstract We introduce a construction called the cone over a graph. It is a natural generalisation of Mycielski's construction. We give a formula for the fractional chromatic numbers of all cones over graphs, which generalizes that given in 3 for Mycielski's construction. © 2001 John Wiley & Sons, Inc. J Graph Theory 38: 87–94, 2001