A generalization of interval edge-colorings of graphs
From MaRDI portal
Publication:602763
DOI10.1016/j.dam.2010.06.012zbMath1208.05030OpenAlexW2025020555MaRDI QIDQ602763
V. M. Baghdasaryan, H. Z. Arakelyan, Petros A. Petrosyan
Publication date: 5 November 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2010.06.012
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Compact scheduling of zero-one time operations in multi-stage systems
- On interval edge colorings of \((\alpha ,\beta )\)-biregular bipartite graphs
- Construction of an edge coloring of a special form in a bipartite graph and its applications in scheduling problems
- Chromatic optimisation: Limitations, objectives, uses, references
- Minimizing irregularities in sports schedules using graph theory
- On the deficiency of bipartite graphs
- Investigation on interval edge-colorings of graphs
- Some graphical properties of matrices with non-negative entries
- Investigations on an edge coloring problem
- Construction of sports schedules with multiple venues
- Thank Evans!
- Embedding Incomplete Latin Squares
- Scheduling in Sports
- Compact Cylindrical Chromatic Scheduling
- On the Complexity of Timetable and Multicommodity Flow Problems
- Compactness and balancing in scheduling
- Interval colorings of edges of a multigraph
- Graph Colorings
- An upper bound for the chromatic number of a graph and its application to timetabling problems
- The preparation of examination time-tables using a small-store computer
- Compact Scheduling In Open Shop With Zero-One Time Operations
