Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules
From MaRDI portal
Publication:6041828
DOI10.1016/j.dam.2022.07.015zbMath1514.05127arXiv2106.03531OpenAlexW3167501677MaRDI QIDQ6041828
Armen S. Asratian, Petros A. Petrosyan, Carl Johan Casselgren
Publication date: 15 May 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2106.03531
Deterministic scheduling theory in operations research (90B35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Link scheduling in wireless sensor networks: distributed edge-coloring revisited
- 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
- On Vizing's bound for the chromatic index of a multigraph
- On the thickness and arboricity of a graph
- Planar graphs: Theory and algorithms
- On the deficiency of bipartite graphs
- Investigation on interval edge-colorings of graphs
- Cyclic deficiency of graphs
- On interval and cyclic interval edge colorings of \((3, 5)\)-biregular graphs
- On Interval Edge Colorings of Biregular Bipartite Graphs With Small Vertex Degrees
- Interval coloring of (3,4)-biregular bipartite graphs having large cubic subgraphs
- On cyclically-interval edge colorings of trees
- Edge-Disjoint Spanning Trees of Finite Graphs
- Proper path‐factors and interval edge‐coloring of (3,4)‐biregular bigraphs
- Open Shop Scheduling to Minimize Finish Time
- On interval edge-colorings of outerplanar graphs
- Some results on cyclic interval edge colorings of graphs
- Integer programming formulations for minimum deficiency interval coloring
- Interval colorings of edges of a multigraph
- Interval Non‐edge‐Colorable Bipartite Graphs and Multigraphs
- A Theorem on Coloring the Lines of a Network
