Publication:4940090
From MaRDI portal
zbMath0933.05050MaRDI QIDQ4940090
Publication date: 1 March 2000
68Q25: Analysis of algorithms and problem complexity
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Unnamed Item, Interval Non‐edge‐Colorable Bipartite Graphs and Multigraphs, NP-hardness of compact scheduling in simplified open and flow shops., Fixed-parameter complexity of \(\lambda\)-labelings, The deficiency of all generalized Hertz graphs and minimal consecutively non-colourable graphs in this class, A comparison of integer and constraint programming models for the deficiency problem, Forbidden structures for planar perfect consecutively colourable graphs, On compact \(k\)-edge-colorings: a polynomial time reduction from linear to cyclic, Compact scheduling of zero-one time operations in multi-stage systems, Lower bounds and a tabu search algorithm for the minimum deficiency problem, On interval edge colorings of \((\alpha ,\beta )\)-biregular bipartite graphs, On the structure and deficiency of \(k\)-trees with bounded degree, Interval edge-colorings of complete graphs and \(n\)-dimensional cubes, Greedy \(T\)-colorings of graphs, On the deficiency of bipartite graphs, Chromatic scheduling in a cyclic open shop, Some remarks on interval colorings of complete tripartite and biregular graphs, On interval \(\Delta\)-coloring of bipartite graphs, On interval and cyclic interval edge colorings of \((3, 5)\)-biregular graphs, The deficiency of a regular graph, On Interval Edge Colorings of Biregular Bipartite Graphs With Small Vertex Degrees, On improper interval edge colourings, Symmetry Breaking Constraints for the Minimum Deficiency Problem, Interval coloring of (3,4)-biregular bipartite graphs having large cubic subgraphs, Proper path‐factors and interval edge‐coloring of (3,4)‐biregular bigraphs
