Publication:3424895

From MaRDI portal


zbMath1127.05046MaRDI QIDQ3424895

Xuding Zhu

Publication date: 5 March 2007



05C15: Coloring of graphs and hypergraphs


Related Items

Circular chromatic number of induced subgraphs of Kneser graphs, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, List circular coloring of trees and cycles, A generalization of Kneser's conjecture, Circular edge-colorings of cubic graphs with girth six, Circular edge-colorings of cubic graphs with girth six, Circular coloring of graphs via linear programming and tabu search, A combinatorial proof for the circular chromatic number of Kneser graphs, Cyclic orderings and cyclic arboricity of matroids, 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, Graphs with bounded tree-width and large odd-girth are almost bipartite, Circular flow on signed graphs, Brooks' theorem via the Alon-Tarsi theorem, An analogue of Dirac's theorem on circular super-critical graphs, Coloring the Cartesian sum of graphs, A connection between circular colorings and periodic schedules, Circular game chromatic number of graphs, Density of 5/2-critical graphs, Asymptotic lower bounds on circular chromatic index of snarks, 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, 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, K4-free graphs with no odd hole: Even pairs and the circular chromatic number, Circular coloring of random graphs: statistical physics investigation, Circular chromatic index of Cartesian products of graphs, Circular choosability via combinatorial Nullstellensatz