On interval colouring reorientation number of oriented graphs
From MaRDI portal
Publication:6648249
DOI10.1016/J.DAM.2024.07.027MaRDI QIDQ6648249
Rita Zuazua, Marta Borowiecka-Olszewska, Ewa Drgas-Burchardt
Publication date: 4 December 2024
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
digraphoriented graphdeficiencyconsecutive colouringinterval colouringperfect interval consecutively colourable graph
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The deficiency of all generalized Hertz graphs and minimal consecutively non-colourable graphs in this class
- Forbidden structures for planar perfect consecutively colourable graphs
- Covering radius 1985-1994
- 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
- On tournaments and their largest transitive subtournaments
- On tournaments free of large transitive subtournaments
- Consecutive colouring of oriented graphs
- On interval and cyclic interval edge colorings of \((3, 5)\)-biregular graphs
- On interval colourings of bi-regular bipartite graphs
- Graph Theory
- On Interval Edge Colorings of Biregular Bipartite Graphs With Small Vertex Degrees
- On cyclically-interval edge colorings of trees
- Interval colorings of edges of a multigraph
- Graph Colorings
- Digraphs
- Consecutive colorings of the edges of general graphs
- Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules
- A note on interval colourings of graphs
This page was built for publication: On interval colouring reorientation number of oriented graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6648249)
