scientific article; zbMATH DE number 1161387
From MaRDI portal
Publication:4393386
zbMATH Open0903.05021MaRDI QIDQ4393386FDOQ4393386
Authors: Krzysztof Giaro, Marek Kubale
Publication date: 2 December 1998
Title of this publication is not available (Why is that?)
Recommendations
Cited In (33)
- Consecutive edge-colorings of generalized \(\theta \)-graphs
- On resistance of graphs
- Interval cyclic edge-colorings of graphs
- The deficiency of all generalized Hertz graphs and minimal consecutively non-colourable graphs in this class
- Proper edge colorings of Cartesian products with rainbow \(C_4\)-s
- Interval edge-colorings of \(K_{1, m, n}\)
- Interval colourable orientations of graphs
- Consecutive colouring of oriented graphs
- One-sided interval edge-colorings of bipartite graphs
- A note on one-sided interval edge colorings of bipartite graphs
- Compact scheduling of zero-one time operations in multi-stage systems
- Consecutive colorings of the edges of general graphs
- On interval edge colorings of \((\alpha ,\beta )\)-biregular bipartite graphs
- Interval edge-colorings of complete graphs and \(n\)-dimensional cubes
- Cyclic deficiency of graphs
- A generalization of interval edge-colorings of graphs
- On path factors of \((3,4)\)-biregular bigraphs
- Consecutive edge-coloring of the generalized \(\theta \)-graph
- Interval non-edge-colorable bipartite graphs and multigraphs
- Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules
- Interval colorings of graphs—Coordinated and unstable no‐wait schedules
- On interval colouring reorientation number of oriented graphs
- Consecutive colorings of graphs
- Some remarks on interval colorings of complete tripartite and biregular graphs
- Some bounds on the number of colors in interval and cyclic interval edge colorings of graphs
- On interval edge colorings of biregular bipartite graphs with small vertex degrees
- Proper path‐factors and interval edge‐coloring of (3,4)‐biregular bigraphs
- Further results on the deficiency of graphs
- Interval edge-colorings of composition of graphs
- Forbidden structures for planar perfect consecutively colourable graphs
- On interval and cyclic interval edge colorings of \((3, 5)\)-biregular graphs
- NP-hardness of compact scheduling in simplified open and flow shops.
- Improper interval edge colorings of graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4393386)