scientific article
From MaRDI portal
Publication:4033261
zbMath0769.05040MaRDI QIDQ4033261
Publication date: 16 May 1993
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (34)
Further results on the deficiency of graphs ⋮ ON INTERVAL EDGE-COLORINGS OF COMPLETE MULTIPARTITE 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 ⋮ On an interval (1, 1)-coloring of incidentors of interval colorable graphs ⋮ A comparison of integer and constraint programming models for the deficiency problem ⋮ On interval and cyclic interval edge colorings of \((3, 5)\)-biregular graphs ⋮ A note on one-sided interval edge colorings of bipartite graphs ⋮ On interval edge colorings of \((\alpha ,\beta )\)-biregular bipartite graphs ⋮ Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules ⋮ Interval edge-colorings of \(K_{1, m, n}\) ⋮ 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 ⋮ Compact cyclic edge-colorings of graphs ⋮ On the structure and deficiency of \(k\)-trees with bounded degree ⋮ 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 ⋮ CHAIN STRUCTURES IN SCHEDULES TASKS ⋮ Consecutive colouring of oriented graphs ⋮ Interval edge-colorings of composition of graphs ⋮ 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 ⋮ Interval coloring of (3, 4)-biregular bigraphs having two (2,3)-biregular bipartite subgraphs ⋮ Chromatic scheduling in a cyclic open shop ⋮ Compact scheduling of zero-one time operations in multi-stage systems ⋮ Cyclic deficiency of graphs ⋮ Some remarks on interval colorings of complete tripartite and biregular graphs ⋮ On the deficiency of bipartite graphs ⋮ On interval \(\Delta\)-coloring of bipartite graphs
This page was built for publication:
