scientific article
From MaRDI portal
Publication:2713634
zbMath0963.05049MaRDI QIDQ2713634
C. O. M. Loten, Denis Hanson, Bjarne Toft
Publication date: 10 June 2001
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (39)
Further results on the deficiency of graphs ⋮ Interval cyclic edge-colorings of graphs ⋮ The deficiency of all generalized Hertz graphs and minimal consecutively non-colourable graphs in this class ⋮ One-sided interval edge-colorings of bipartite graphs ⋮ Lower bounds and a tabu search algorithm for the minimum deficiency problem ⋮ On an interval (1, 1)-coloring of incidentors of interval colorable graphs ⋮ A comparison of integer and constraint programming models for the deficiency problem ⋮ Cut-edges and regular factors in regular graphs of odd degree ⋮ On interval and cyclic interval edge colorings of \((3, 5)\)-biregular graphs ⋮ A generalization of interval edge-colorings of graphs ⋮ A note on one-sided interval edge colorings of bipartite graphs ⋮ On interval edge colorings of \((\alpha ,\beta )\)-biregular bipartite graphs ⋮ On Interval Edge Colorings of Biregular Bipartite Graphs With Small Vertex Degrees ⋮ Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules ⋮ Interval colorings of graphs—Coordinated and unstable no‐wait schedules ⋮ Some bounds on the number of colors in interval and cyclic interval edge colorings of graphs ⋮ A note on upper bounds for the maximum span in interval edge-colorings of graphs ⋮ On the structure and deficiency of \(k\)-trees with bounded degree ⋮ Symmetry Breaking Constraints for the Minimum Deficiency Problem ⋮ On resistance of graphs ⋮ Consecutive edge-coloring of the generalized \(\theta \)-graph ⋮ On compact \(k\)-edge-colorings: a polynomial time reduction from linear to cyclic ⋮ Improper interval edge colorings of graphs ⋮ Consecutive colouring of oriented graphs ⋮ Forbidden structures for planar perfect consecutively colourable graphs ⋮ Largest 2-regular subgraphs in 3-regular graphs ⋮ NP-hardness of compact scheduling in simplified open and flow shops. ⋮ Interval edge-colorings of complete graphs and \(n\)-dimensional cubes ⋮ Interval coloring of (3, 4)-biregular bigraphs having two (2,3)-biregular bipartite subgraphs ⋮ Compact scheduling of zero-one time operations in multi-stage systems ⋮ Cyclic deficiency of graphs ⋮ On star edge colorings of bipartite and subcubic graphs ⋮ On path factors of \((3,4)\)-biregular bigraphs ⋮ Proper path‐factors and interval edge‐coloring of (3,4)‐biregular bigraphs ⋮ Some remarks on interval colorings of complete tripartite and biregular graphs ⋮ Interval Non‐edge‐Colorable Bipartite Graphs and Multigraphs ⋮ On the deficiency of bipartite graphs ⋮ Unnamed Item ⋮ On interval \(\Delta\)-coloring of bipartite graphs
This page was built for publication:
