scientific article
From MaRDI portal
Publication:3424895
zbMath1127.05046MaRDI QIDQ3424895
Publication date: 5 March 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (39)
On the odd girth and the circular chromatic number of generalized Petersen graphs ⋮ Cycles in color-critical graphs ⋮ Decreasing the maximum average degree by deleting an independent set or a \(d\)-degenerate subgraph ⋮ Strengthening topological colorful results for graphs ⋮ Circular coloring of graphs via linear programming and tabu search ⋮ List circular coloring of trees and cycles ⋮ A combinatorial proof for the circular chromatic number of Kneser graphs ⋮ Signed planar graphs with given circular chromatic numbers ⋮ An analogue of Dirac's theorem on circular super-critical graphs ⋮ 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 ⋮ Cyclic orderings and cyclic arboricity of matroids ⋮ Density of 5/2-critical graphs ⋮ Asymptotic lower bounds on circular chromatic index of snarks ⋮ On the theta number of powers of cycle graphs ⋮ Circular chromatic number of induced subgraphs of Kneser graphs ⋮ Circular flow on signed graphs ⋮ Nowhere-zero 3-flows and modulo \(k\)-orientations ⋮ A generalization of Kneser's conjecture ⋮ Circular chromatic index of Cartesian products of graphs ⋮ On circular-perfect graphs: a survey ⋮ \(T\)-colorings, divisibility and the circular chromatic number ⋮ On the chromatic number of general Kneser hypergraphs ⋮ Circular coloring of random graphs: statistical physics investigation ⋮ Circular edge-colorings of cubic graphs with girth six ⋮ An introduction to the discharging method via graph coloring ⋮ Circular edge-colorings of cubic graphs with girth six ⋮ Brooks' theorem via the Alon-Tarsi theorem ⋮ Circular choosability via combinatorial Nullstellensatz ⋮ K4-free graphs with no odd hole: Even pairs and the circular chromatic number ⋮ Circular chromatic number of signed graphs ⋮ Coloring the Cartesian sum of graphs ⋮ A connection between circular colorings and periodic schedules ⋮ The circular chromatic numbers of signed series-parallel graphs ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg ⋮ Circular game chromatic number of graphs ⋮ Circular chromatic indices of even degree regular graphs ⋮ Circular flow number of highly edge connected signed graphs
This page was built for publication:
