Circular chromatic number: A survey

DOI10.1016/S0012-365X(00)00217-XzbMath0973.05030OpenAlexW1526979981WikidataQ130442319 ScholiaQ130442319MaRDI QIDQ5931460

Xuding Zhu

Publication date: 5 July 2001

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(00)00217-x

zbMATH Keywords

circular chromatic numberfractional chromatic numberplanar graphsgraph minorcircular flowdistance graphflowgirthgraph homomorphismweighted graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (only showing first 100 items - show all)

Claw‐free circular‐perfect graphs ⋮ Unnamed Item ⋮ Cyclic 4-Colorings of Graphs on Surfaces ⋮ Mixing Homomorphisms, Recolorings, and Extending Circular Precolorings ⋮ Fractional, Circular, and Defective Coloring of Series-Parallel Graphs ⋮ Extensions of Fractional Precolorings Show Discontinuous Behavior ⋮ On the circular altitude of graphs ⋮ Maximal density of sets with missing differences and various coloring parameters of distance graphs ⋮ Study of $$\kappa (D)$$ for $$D = \{2, 3, x, y\}$$ ⋮ THE GRAPH-BIN PACKING PROBLEM ⋮ Extremal decompositions for Nordhaus-Gaddum theorems ⋮ Circular coloring and fractional coloring in planar graphs ⋮ The circular chromatic number of signed series-parallel graphs of given girth ⋮ Circular-imperfection of triangle-free graphs ⋮ Characterizing circular colouring mixing for pq<4 $\frac{p}{q}\lt 4$ ⋮ Maximal density and the kappa values for the families \(\{a,a+1,2a+1,n\}\) and \(\{a,a+1,2a+1,3a+1,n\}\) ⋮ Distance Graphs Generated by Five Primes (Research) ⋮ On two questions about circular choosability ⋮ Real flow number and the cycle rank of a graph ⋮ A survey of graph coloring - its types, methods and applications ⋮ Circular chromatic number of induced subgraphs of Kneser graphs ⋮ An analogue of Hajós’ Theorem for the circular chromatic number ⋮ Multi-coloring the Mycielskian of graphs ⋮ Colorful subgraphs in Kneser-like graphs ⋮ Circular edge-colorings of cubic graphs with girth six ⋮ The circular chromatic index of Goldberg snarks ⋮ Circular consecutive choosability of k-choosable graphs ⋮ Circular edge-colorings of cubic graphs with girth six ⋮ On classes of minimal circular-imperfect graphs ⋮ Between 2- and 3-colorability ⋮ A note onn-tuple colourings and circular colourings of planar graphs with large odd girth ⋮ Several parameters of generalized Mycielskians ⋮ Extending precolorings to circular colorings ⋮ Circular chromatic index of type 1 Blanuša snarks ⋮ Circular choosability via combinatorial Nullstellensatz ⋮ K4-free graphs with no odd hole: Even pairs and the circular chromatic number ⋮ The chromatic number of random Cayley graphs ⋮ Short proofs for two theorems of Chien, Hell and Zhu ⋮ \(L(j,k)\)-labeling number of Cartesian product of path and cycle ⋮ The circular chromatic number of the Mycielskian ofGdk ⋮ Coloring-flow duality of embedded graphs ⋮ A Notion of Total Dual Integrality for Convex, Semidefinite, and Extended Formulations ⋮ The circular altitude of a graph ⋮ Snarks with given real flow numbers ⋮ The plane-width of graphs ⋮ Short cycle covers of graphs and nowhere-zero flows ⋮ On Equitable Coloring of Central Graphs and Total Graphs ⋮ Properties of an Approximability-related Parameter on Circular Complete Graphs ⋮ Circular Chromatic Indices of Regular Graphs ⋮ Coloring of distance graphs with intervals as distance sets ⋮ Introduction to dominated edge chromatic number of a graph ⋮ Multiplicative graphs and semi-lattice endomorphisms in the category of graphs ⋮ Minimally circular-imperfect graphs with a major vertex ⋮ Coloring the Cartesian Sum of Graphs ⋮ Circular chromatic number of triangle free graphs with given maximum average degree, extended abstract ⋮ On the Circular Chromatic Number of Graph Powers ⋮ Circular flows of nearly Eulerian graphs and vertex-splitting ⋮ Convex-round graphs are circular-perfect ⋮ Asymptotic clique covering ratios of distance graphs ⋮ On the odd girth and the circular chromatic number of generalized Petersen graphs ⋮ Cycles in color-critical graphs ⋮ Strengthening topological colorful results for graphs ⋮ Circular chromatic number for iterated Mycielski graphs ⋮ A revival of the girth conjecture ⋮ The circular chromatic number of induced subgraphs ⋮ The circular chromatic index ⋮ Circular colouring and algebraic no-homomorphism theorems ⋮ A dichotomy theorem for circular colouring reconfiguration ⋮ Circular coloring of graphs via linear programming and tabu search ⋮ First non-trivial upper bound on circular chromatic number of the plane ⋮ A combinatorial proof for the circular chromatic number of Kneser graphs ⋮ On the density of \(C_7\)-critical graphs ⋮ The circular chromatic index of graphs of high girth ⋮ Square-free graphs are multiplicative ⋮ Smallest \(C_{2 \ell + 1}\)-critical graphs of odd-girth \(2 k + 1\) ⋮ Hadwiger's conjecture for circular colorings of edge-weighted graphs ⋮ On defining numbers of circular complete graphs ⋮ Signed planar graphs with given circular chromatic numbers ⋮ Mixed hypergraphs and other coloring problems ⋮ Graph \(r\)-hued colorings -- a survey ⋮ An analogue of Dirac's theorem on circular super-critical graphs ⋮ Graphs with bounded tree-width and large odd-girth are almost bipartite ⋮ Optimal colorings with rainbow paths ⋮ On \(J\)-colorability of certain derived graph classes ⋮ Minmax relations for cyclically ordered digraphs ⋮ Circular coloring of planar digraphs ⋮ Constructing uniquely realizable graphs ⋮ Resource-sharing systems and hypergraph colorings ⋮ Circular chromatic number of Kneser graphs ⋮ Circular total chromatic numbers of graphs ⋮ Cyclic orderings and cyclic arboricity of matroids ⋮ Compact cyclic edge-colorings of graphs ⋮ On the adaptable chromatic number of graphs ⋮ Minimal circular-imperfect graphs of large clique number and large independence number ⋮ Some star extremal circulant graphs ⋮ Dilation coefficient, plane-width, and resolution coefficient of graphs ⋮ Density of 5/2-critical graphs ⋮ \(k\)-regular graphs with the circular chromatic index close to \(k\) ⋮ Asymptotic lower bounds on circular chromatic index of snarks ⋮ Flows and parity subgraphs of graphs with large odd-edge-connectivity

This page was built for publication: Circular chromatic number: A survey