Interval colorings of graphs—Coordinated and unstable no‐wait schedules

DOI10.1002/jgt.23003arXiv2205.05947OpenAlexW4383224348MaRDI QIDQ6084715

Maria A. Axenovich, Unnamed Author

Publication date: 6 November 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.05947

zbMATH Keywords

scheduleno-waitinterval coloringedge-decomposition

Mathematics Subject Classification ID

Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The deficiency of all generalized Hertz graphs and minimal consecutively non-colourable graphs in this class
• Forbidden structures for planar perfect consecutively colourable graphs
• 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 the thickness and arboricity of a graph
• Investigation on interval edge-colorings of graphs
• Perfect matchings in \(\varepsilon\)-regular graphs
• Consecutive colouring of oriented graphs
• On interval and cyclic interval edge colorings of \((3, 5)\)-biregular graphs
• Graph Theory
• On Interval Edge Colorings of Biregular Bipartite Graphs With Small Vertex Degrees
• Interval coloring of (3,4)-biregular bipartite graphs having large cubic subgraphs
• Proper path‐factors and interval edge‐coloring of (3,4)‐biregular bigraphs
• Interval colorings of edges of a multigraph
• Interval Non‐edge‐Colorable Bipartite Graphs and Multigraphs
• Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules

This page was built for publication: Interval colorings of graphs—Coordinated and unstable no‐wait schedules