scientific article; zbMATH DE number 165470
From MaRDI portal
Publication:4033261
zbMATH Open0769.05040MaRDI QIDQ4033261FDOQ4033261
Authors: Sergey Sevastyanov 
Publication date: 16 May 1993
Title of this publication is not available (Why is that?)
Recommendations
- On interval edge colorings of \((\alpha ,\beta )\)-biregular bipartite graphs
- Some remarks on interval colorings of complete tripartite and biregular graphs
- On interval colourings of bi-regular bipartite graphs
- Interval coloring of (3,4)-biregular bipartite graphs having large cubic subgraphs
- On interval edge colorings of biregular bipartite graphs with small vertex degrees
Cited In (47)
- On the structure and deficiency of \(k\)-trees with bounded degree
- A note on interval colourings of graphs
- Interval coloring of (3, 4)-biregular bigraphs having two (2,3)-biregular bipartite subgraphs
- 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
- Interval edge coloring of a graph with forbidden colors
- Interval edge-colorings of \(K_{1, m, n}\)
- A note on upper bounds for the maximum span in interval edge-colorings of graphs
- Interval colourable orientations of graphs
- Consecutive colouring of oriented graphs
- Determining the total colouring number is NP-hard
- 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
- On interval edge colorings of \((\alpha ,\beta )\)-biregular bipartite graphs
- Interval edge-colorings of complete graphs and \(n\)-dimensional cubes
- Cyclic deficiency of graphs
- On the deficiency of bipartite graphs
- CHAIN STRUCTURES IN SCHEDULES TASKS
- Separating type-I odd-cycle inequalities for a binary-encoded edge-coloring formulation
- Chromatic scheduling in a cyclic open shop
- Consecutive edge-coloring of the generalized \(\theta \)-graph
- Decomposing graphs into interval colorable subgraphs and no-wait multi-stage schedules
- Interval colorings of graphs—Coordinated and unstable no‐wait schedules
- Upper bounds on the number of colors in interval edge-colorings of graphs
- ON INTERVAL EDGE-COLORINGS OF COMPLETE MULTIPARTITE GRAPHS
- Edge and total coloring of interval graphs
- A comparison of integer and constraint programming models for the deficiency problem
- The inclusion-free edge-colorings of \((3, \varDelta)\)-bipartite graphs
- On interval colouring reorientation number of oriented graphs
- Compact cyclic edge-colorings of graphs
- On one-sided interval edge colorings of biregular bipartite graphs
- Some remarks on interval colorings of complete tripartite and biregular graphs
- On interval \(\Delta\)-coloring of bipartite graphs
- Some bounds on the number of colors in interval and cyclic interval edge colorings of graphs
- On interval colourings of bi-regular bipartite graphs
- Title not available (Why is that?)
- On an interval (1, 1)-coloring of incidentors of interval colorable graphs
- Title not available (Why is that?)
- Further results on the deficiency of graphs
- On compact \(k\)-edge-colorings: a polynomial time reduction from linear to cyclic
- 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 Q4033261)
