@article{Dhamala_2010, title={Some Discrete Optimization Problems With Hamming and H-Comparability Graphs}, volume={27}, url={https://www.nepjol.info/index.php/TUJ/article/view/26400}, DOI={10.3126/tuj.v27i1-2.26400}, abstractNote={<p>Any H-comparability graph contains a Hamming graph as spanningsubgraph. An acyclic orientation of an H-comparability graph contains an acyclic orientation of the spanning Hamming graph, called sequence graph in the classical open-shop scheduling problem. We formulate different discrete optimization problems on the Hamming graphs and on H-comparability graphs and consider their complexity and relationship. Moreover, we explore the structures of these graphs in the class of irreducible sequences for the open shop problem in this paper.</p>}, number={1-2}, journal={Tribhuvan University Journal}, author={Dhamala, Tanka Nath}, year={2010}, month={Dec.}, pages={167–176} }