Consecutive colouring of oriented graphs
DOI10.1007/s00025-021-01505-3zbMath1477.05073OpenAlexW3200691751MaRDI QIDQ2242444
Marta Borowiecka-Olszewska, Ewa Drgas-Burchardt, Nahid Y. Javier-Nol, Rita E. Zuazua
Publication date: 9 November 2021
Published in: Results in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00025-021-01505-3
digraphoriented graphconsecutive colouringforbidden graphinterval colouringperfect consecutively colourable graph
Deterministic scheduling theory in operations research (90B35) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Directed graphs (digraphs), tournaments (05C20)
Related Items (1)
Cites Work
- The deficiency of all generalized Hertz graphs and minimal consecutively non-colourable graphs in this class
- Forbidden structures for planar perfect consecutively colourable graphs
- Decomposing a planar graph with girth at least 8 into a forest and a matching
- Compact scheduling of zero-one time operations in multi-stage systems
- On the structure and deficiency of \(k\)-trees with bounded degree
- On the deficiency of bipartite graphs
- Investigation on interval edge-colorings of graphs
- Tree decompositions for a class of 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
- On one-sided interval edge colorings of biregular bipartite graphs
- Interval colorings of edges of a multigraph
- Graph Colorings
- Digraphs
- k-Degenerate Graphs
- Consecutive colorings of the edges of general graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Consecutive colouring of oriented graphs
