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