Lower bounds and a tabu search algorithm for the minimum deficiency problem
From MaRDI portal
(Redirected from Publication:841600)
Recommendations
Cites work
- Consecutive colorings of the edges of general graphs
- Generating random regular graphs
- scientific article; zbMATH DE number 951847 (Why is no real title available?)
- scientific article; zbMATH DE number 1409249 (Why is no real title available?)
- Interval coloring of (3,4)-biregular bipartite graphs having large cubic subgraphs
- On interval colourings of bi-regular bipartite graphs
- On interval edge colorings of ( , )-biregular bipartite graphs
- On the deficiency of bipartite graphs
- The deficiency of a regular graph
Cited in
(9)- Cyclic deficiency of graphs
- Further results on the deficiency of graphs
- Symmetry breaking constraints for the minimum deficiency problem
- A comparison of integer and constraint programming models for the deficiency problem
- Integer programming formulations for minimum deficiency interval coloring
- On resistance of graphs
- On compact \(k\)-edge-colorings: a polynomial time reduction from linear to cyclic
- On deficiency of complete 3-partite and 4-partite graphs
- Interval edge-colorings of complete graphs and \(n\)-dimensional cubes
This page was built for publication: Lower bounds and a tabu search algorithm for the minimum deficiency problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q841600)