The following pages link to (Q4940090):
Displaying 25 items.
- The deficiency of all generalized Hertz graphs and minimal consecutively non-colourable graphs in this class (Q279204) (← links)
- A comparison of integer and constraint programming models for the deficiency problem (Q342299) (← links)
- Forbidden structures for planar perfect consecutively colourable graphs (Q521749) (← links)
- On compact \(k\)-edge-colorings: a polynomial time reduction from linear to cyclic (Q666002) (← links)
- Compact scheduling of zero-one time operations in multi-stage systems (Q705502) (← links)
- Lower bounds and a tabu search algorithm for the minimum deficiency problem (Q841600) (← links)
- On interval edge colorings of \((\alpha ,\beta )\)-biregular bipartite graphs (Q882116) (← links)
- On the structure and deficiency of \(k\)-trees with bounded degree (Q908291) (← links)
- Interval edge-colorings of complete graphs and \(n\)-dimensional cubes (Q968437) (← links)
- Greedy \(T\)-colorings of graphs (Q1024485) (← links)
- On the deficiency of bipartite graphs (Q1293200) (← links)
- Chromatic scheduling in a cyclic open shop (Q1767677) (← links)
- Some remarks on interval colorings of complete tripartite and biregular graphs (Q2306598) (← links)
- On interval \(\Delta\)-coloring of bipartite graphs (Q2356135) (← links)
- On interval and cyclic interval edge colorings of \((3, 5)\)-biregular graphs (Q2401803) (← links)
- The deficiency of a regular graph (Q2501566) (← links)
- On Interval Edge Colorings of Biregular Bipartite Graphs With Small Vertex Degrees (Q2947944) (← links)
- On improper interval edge colourings (Q2955929) (← links)
- Symmetry Breaking Constraints for the Minimum Deficiency Problem (Q2971392) (← links)
- Interval coloring of (3,4)-biregular bipartite graphs having large cubic subgraphs (Q3159395) (← links)
- Proper path‐factors and interval edge‐coloring of (3,4)‐biregular bigraphs (Q3632998) (← links)
- (Q5150426) (← links)
- Interval Non‐edge‐Colorable Bipartite Graphs and Multigraphs (Q5495881) (← links)
- NP-hardness of compact scheduling in simplified open and flow shops. (Q5932026) (← links)
- Fixed-parameter complexity of \(\lambda\)-labelings (Q5948961) (← links)