References
- Bang-JensenJGutinGAlternating cycles and paths in edge-coloured multigraphs: A surveyDiscrete Mathematics1997165–166396010.1016/S0012-365X(96)00160-4
- BrandstädtALeVBSpinradJBGraph Classes—A Survey1999
- ChvátalVHammerPLSet Packing Problems and Threshold Graphs1973
- ChvátalVHammerPLAggregation of inequalities in integer programmingStudies in Integer Programming. Annals of Discrete Mathematics 11977145162
- CookWJCunninghamWHPulleyblankWRSchrijverACombinatorial Optimization1998
- EckerKZaksSOn a Graph Labelling Problem1977
- GilmorePCGomoryREA linear programming approach to the cutting-stock problemOperations Research19619684985910.1287/opre.9.6.849
- GilmorePCGomoryREA linear programming approach to the cutting stock problem—Part IIOperations Research196311686388810.1287/opre.11.6.863
- GolumbicMCAlgorithmic Graph Theory and Perfect Graphs1980
- GoulimisCMinimum score separation—an open combinatorial problem associated with the cutting stock problemJournal of the Operational Research Society200455121367136810.1057/palgrave.jors.2601835
- HendersonPBZalcsteinYA graph-theoretic characterization of the PVchunk class of synchronizing primitivesSIAM Journal of Computing1977618810810.1137/0206008
- KarpRMReducibility among combinatorial problemsComplexity of Computer Computations197285103
- KorenMExtreme degree sequences of simple graphsJournal of Combinatorial Theory B197315321322410.1016/0095-8956(73)90037-3
- LaporteGAsef-VaziriASriskandarajahCSome applications of the generalized Travelling Salesman ProblemJournal of the Operational Research Society199647121461146710.1057/jors.1996.190
- LewisRSongXDowslandKThompsonJAn investigation into two bin packing problems with ordering and orientation implicationsEuropean Journal of Operational Research20112131526510.1016/j.ejor.2011.03.016
- MahadevNVRPeledUNLongest cycles in threshold graphsDiscrete Mathematics19941351-316917610.1016/0012-365X(93)E0077-H
- MahadevNVRPeledUNThreshold Graphs and Related Topics. Annals of Discrete Mathematics 561995