On interval colouring reorientation number of oriented graphs
From MaRDI portal
Recommendations
Cites work
- A note on interval colourings of graphs
- Compact scheduling of zero-one time operations in multi-stage systems
- Consecutive colorings of the edges of general graphs
- Consecutive colouring of oriented graphs
- Covering radius 1985-1994
- Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules
- Digraphs
- Forbidden structures for planar perfect consecutively colourable graphs
- Graph Colorings
- Graph theory
- scientific article; zbMATH DE number 165470 (Why is no real title available?)
- scientific article; zbMATH DE number 1194938 (Why is no real title available?)
- scientific article; zbMATH DE number 1024657 (Why is no real title available?)
- scientific article; zbMATH DE number 1161387 (Why is no real title available?)
- scientific article; zbMATH DE number 1990715 (Why is no real title available?)
- scientific article; zbMATH DE number 3221981 (Why is no real title available?)
- Interval colorings of edges of a multigraph
- Investigation on interval edge-colorings of graphs
- On cyclically-interval edge colorings of trees
- On interval and cyclic interval edge colorings of \((3, 5)\)-biregular graphs
- On interval colourings of bi-regular bipartite graphs
- On interval edge colorings of biregular bipartite graphs with small vertex degrees
- On the deficiency of bipartite graphs
- On the structure and deficiency of k-trees with bounded degree
- On tournaments and their largest transitive subtournaments
- On tournaments free of large transitive subtournaments
- The deficiency of all generalized Hertz graphs and minimal consecutively non-colourable graphs in this class
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)