Pages that link to "Item:Q705502"
From MaRDI portal
The following pages link to Compact scheduling of zero-one time operations in multi-stage systems (Q705502):
Displaying 27 items.
- Interval cyclic edge-colorings of graphs (Q279196) (← links)
- Interval edge-colorings of composition of graphs (Q516842) (← links)
- Forbidden structures for planar perfect consecutively colourable graphs (Q521749) (← links)
- A generalization of interval edge-colorings of graphs (Q602763) (← links)
- On resistance of graphs (Q643030) (← links)
- On interval edge colorings of \((\alpha ,\beta )\)-biregular bipartite graphs (Q882116) (← links)
- Interval edge-colorings of complete graphs and \(n\)-dimensional cubes (Q968437) (← links)
- On path factors of \((3,4)\)-biregular bigraphs (Q1014829) (← links)
- Some bounds on the number of colors in interval and cyclic interval edge colorings of graphs (Q1690222) (← links)
- Cyclic deficiency of graphs (Q2026336) (← links)
- Improper interval edge colorings of graphs (Q2235270) (← links)
- Consecutive colouring of oriented graphs (Q2242444) (← links)
- Interval incidence graph coloring (Q2255045) (← links)
- Some remarks on interval colorings of complete tripartite and biregular graphs (Q2306598) (← links)
- Further results on the deficiency of graphs (Q2357781) (← links)
- On interval and cyclic interval edge colorings of \((3, 5)\)-biregular graphs (Q2401803) (← links)
- On Eulerian extensions and their application to no-wait flowshop scheduling (Q2434285) (← links)
- Consecutive edge-coloring of the generalized \(\theta \)-graph (Q2457013) (← links)
- One-sided interval edge-colorings of bipartite graphs (Q2629271) (← links)
- A note on one-sided interval edge colorings of bipartite graphs (Q2666587) (← links)
- On Interval Edge Colorings of Biregular Bipartite Graphs With Small Vertex Degrees (Q2947944) (← links)
- Proper path‐factors and interval edge‐coloring of (3,4)‐biregular bigraphs (Q3632998) (← links)
- Interval Non‐edge‐Colorable Bipartite Graphs and Multigraphs (Q5495881) (← links)
- Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules (Q6041828) (← links)
- Interval colorings of graphs—Coordinated and unstable no‐wait schedules (Q6084715) (← links)
- Interval colourable orientations of graphs (Q6589119) (← links)
- On interval colouring reorientation number of oriented graphs (Q6648249) (← links)
