Recent developments in circular colouring of graphs
From MaRDI portal
Recommendations
Cited in
(42)- A connection between circular colorings and periodic schedules
- Circular game chromatic number of graphs
- An analogue of Hajós' theorem for the circular chromatic number. II
- Density of 5/2-critical graphs
- Asymptotic lower bounds on circular chromatic index of snarks
- Coloring graphs by translates in the circle
- Circular chromatic number of signed graphs
- The circular chromatic numbers of signed series-parallel graphs
- Cycles in color-critical graphs
- Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph
- Signed planar graphs with given circular chromatic numbers
- On circular-perfect graphs: a survey
- \(T\)-colorings, divisibility and the circular chromatic number
- Circular chromatic indices of even degree regular graphs
- Circular flow number of highly edge connected signed graphs
- On the odd girth and the circular chromatic number of generalized Petersen graphs
- Strengthening topological colorful results for graphs
- On the theta number of powers of cycle graphs
- Circular coloring of graphs via linear programming and tabu search
- \(K_{4}\)-free graphs with no odd hole: even pairs and the circular chromatic number
- A combinatorial proof for the circular chromatic number of Kneser graphs
- Circular coloring of random graphs: statistical physics investigation
- Circular chromatic index of Cartesian products of graphs
- Circular choosability via combinatorial Nullstellensatz
- Cyclic orderings and cyclic arboricity of matroids
- Circular chromatic number of induced subgraphs of Kneser graphs
- Nowhere-zero 3-flows and modulo \(k\)-orientations
- On the chromatic number of general Kneser hypergraphs
- An introduction to the discharging method via graph coloring
- The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
- List circular coloring of trees and cycles
- Circular edge-colorings of cubic graphs with girth six
- A generalization of Kneser's conjecture
- Circular edge-colorings of cubic graphs with girth six
- Graphs with bounded tree-width and large odd-girth are almost bipartite
- Circular coloring and fractional coloring in planar graphs
- The circular chromatic number of signed series-parallel graphs of given girth
- Circular flow on signed graphs
- Brooks' theorem via the Alon-Tarsi theorem
- Higher-dimensional generalization of Youngs' theorem and circular colorings
- An analogue of Dirac's theorem on circular super-critical graphs
- Coloring the Cartesian sum of graphs
This page was built for publication: Recent developments in circular colouring of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3424895)
