scientific article; zbMATH DE number 951847
From MaRDI portal
Publication:4717033
zbMATH Open0861.05024MaRDI QIDQ4717033FDOQ4717033
Authors: D. Hanson, C. O. M. Loten 
Publication date: 4 May 1997
Title of this publication is not available (Why is that?)
Recommendations
- On interval colourings of bi-regular bipartite graphs
- Interval coloring of (3, 4)-biregular bigraphs having two (2,3)-biregular bipartite subgraphs
- On interval edge colorings of biregular bipartite graphs with small vertex degrees
- Interval coloring of (3,4)-biregular bipartite graphs having large cubic subgraphs
- On interval edge colorings of \((\alpha ,\beta )\)-biregular bipartite graphs
Cited In (21)
- On the structure and deficiency of \(k\)-trees with bounded degree
- The deficiency of all generalized Hertz graphs and minimal consecutively non-colourable graphs in this class
- One-sided interval edge-colorings of bipartite graphs
- Symmetry breaking constraints for the minimum deficiency problem
- Compact scheduling of zero-one time operations in multi-stage systems
- On interval edge colorings of \((\alpha ,\beta )\)-biregular bipartite graphs
- On the deficiency of bipartite graphs
- On path factors of \((3,4)\)-biregular bigraphs
- A comparison of integer and constraint programming models for the deficiency problem
- 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
- Lower bounds and a tabu search algorithm for the minimum deficiency problem
- On interval edge colorings of biregular bipartite graphs with small vertex degrees
- Proper path‐factors and interval edge‐coloring of (3,4)‐biregular bigraphs
- Interval coloring of (3,4)-biregular bipartite graphs having large cubic subgraphs
- On compact \(k\)-edge-colorings: a polynomial time reduction from linear to cyclic
- Forbidden structures for planar perfect consecutively colourable graphs
- On interval and cyclic interval edge colorings of \((3, 5)\)-biregular 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 Q4717033)
