Jha, Pranava K. Optimal embeddings of the exchanged hypercube and the dual-cube as vertex-induced subgraphs of the hypercube. (English) Zbl 1516.05153 Discrete Appl. Math. 337, 218-231 (2023). MSC: 05C65 05C60 PDFBibTeX XMLCite \textit{P. K. Jha}, Discrete Appl. Math. 337, 218--231 (2023; Zbl 1516.05153) Full Text: DOI
Bachstein, Anna; Goddard, Wayne; Lehmacher, Connor The generalized matcher game. (English) Zbl 1443.05125 Discrete Appl. Math. 284, 444-453 (2020). MSC: 05C57 91A43 91A05 PDFBibTeX XMLCite \textit{A. Bachstein} et al., Discrete Appl. Math. 284, 444--453 (2020; Zbl 1443.05125) Full Text: DOI arXiv
Baptiste, Philippe; Kovalyov, Mikhail Y.; Orlovich, Yury L.; Werner, Frank; Zverovich, Igor E. Graphs with maximal induced matchings of the same size. (English) Zbl 1350.05129 Discrete Appl. Math. 216, Part 1, 15-28 (2017). MSC: 05C70 05C35 68Q17 05C60 PDFBibTeX XMLCite \textit{P. Baptiste} et al., Discrete Appl. Math. 216, Part 1, 15--28 (2017; Zbl 1350.05129) Full Text: DOI
Chalopin, Jérémie; Paulusma, Daniël Packing bipartite graphs with covers of complete bipartite graphs. (English) Zbl 1285.05146 Discrete Appl. Math. 168, 40-50 (2014). MSC: 05C70 05C60 PDFBibTeX XMLCite \textit{J. Chalopin} and \textit{D. Paulusma}, Discrete Appl. Math. 168, 40--50 (2014; Zbl 1285.05146) Full Text: DOI
Porschen, Stefan; Schmidt, Tatjana; Speckenmeyer, Ewald; Wotzlaw, Andreas XSAT and NAE-SAT of linear CNF classes. (English) Zbl 1284.05106 Discrete Appl. Math. 167, 1-14 (2014). MSC: 05C15 05C65 68Q17 PDFBibTeX XMLCite \textit{S. Porschen} et al., Discrete Appl. Math. 167, 1--14 (2014; Zbl 1284.05106) Full Text: DOI
Orlovich, Yury; Dolgui, Alexandre; Finke, Gerd; Gordon, Valery; Werner, Frank The complexity of dissociation set problems in graphs. (English) Zbl 1223.68058 Discrete Appl. Math. 159, No. 13, 1352-1366 (2011). MSC: 68Q25 05C85 05C69 PDFBibTeX XMLCite \textit{Y. Orlovich} et al., Discrete Appl. Math. 159, No. 13, 1352--1366 (2011; Zbl 1223.68058) Full Text: DOI
Chataigner, F.; Manić, G.; Wakabayashi, Y.; Yuster, R. Approximation algorithms and hardness results for the clique packing problem. (English) Zbl 1172.05046 Discrete Appl. Math. 157, No. 7, 1396-1406 (2009). MSC: 05C69 05C70 05C85 PDFBibTeX XMLCite \textit{F. Chataigner} et al., Discrete Appl. Math. 157, No. 7, 1396--1406 (2009; Zbl 1172.05046) Full Text: DOI
Bardeli, Rolf; Clausen, Michael; Ribbrock, Andreas A covering problem that is easy for trees but \(\mathbf{NP}\)-complete for trivalent graphs. (English) Zbl 1169.05371 Discrete Appl. Math. 156, No. 15, 2855-2866 (2008). MSC: 05C70 05C85 05C05 05C38 PDFBibTeX XMLCite \textit{R. Bardeli} et al., Discrete Appl. Math. 156, No. 15, 2855--2866 (2008; Zbl 1169.05371) Full Text: DOI
MacGillivray, Gary; Yu, Min-Li Generalized partitions of graphs. (English) Zbl 0917.05056 Discrete Appl. Math. 91, No. 1-3, 143-153 (1999). Reviewer: Guojun Li (Jinan) MSC: 05C70 05C15 05C85 68R10 PDFBibTeX XMLCite \textit{G. MacGillivray} and \textit{M.-L. Yu}, Discrete Appl. Math. 91, No. 1--3, 143--153 (1999; Zbl 0917.05056) Full Text: DOI
Lonc, Zbigniew On the complexity of some edge-partition problems for graphs. (English) Zbl 0860.05061 Discrete Appl. Math. 70, No. 2, 177-183 (1996). Reviewer: W.K.Chen (Chicago) MSC: 05C70 68R10 PDFBibTeX XMLCite \textit{Z. Lonc}, Discrete Appl. Math. 70, No. 2, 177--183 (1996; Zbl 0860.05061) Full Text: DOI Link
Hell, P.; Manoussakis, Y.; Tuza, Zs. Packing problems in edge-colored graphs. (English) Zbl 0806.05054 Discrete Appl. Math. 52, No. 3, 295-306 (1994). Reviewer: M.Truszczyński (Lexington) MSC: 05C70 05C15 PDFBibTeX XMLCite \textit{P. Hell} et al., Discrete Appl. Math. 52, No. 3, 295--306 (1994; Zbl 0806.05054) Full Text: DOI
Corneil, Derek G.; Masuyama, Shigeru; Hakimi, S. Louis Edge-disjoint packings of graphs. (English) Zbl 0793.68114 Discrete Appl. Math. 50, No. 2, 135-148 (1994). MSC: 68R10 68Q25 05C70 PDFBibTeX XMLCite \textit{D. G. Corneil} et al., Discrete Appl. Math. 50, No. 2, 135--148 (1994; Zbl 0793.68114) Full Text: DOI
Masuyama, Shigeru On the tree packing problem. (English) Zbl 0739.05072 Discrete Appl. Math. 35, No. 2, 163-166 (1992). MSC: 05C70 05C05 05C85 PDFBibTeX XMLCite \textit{S. Masuyama}, Discrete Appl. Math. 35, No. 2, 163--166 (1992; Zbl 0739.05072) Full Text: DOI
Corneil, D. G. The complexity of generalized clique packing. (English) Zbl 0588.05037 Discrete Appl. Math. 12, 233-239 (1985). Reviewer: L.Niepel MSC: 05C70 05C35 68Q25 68R10 PDFBibTeX XMLCite \textit{D. G. Corneil}, Discrete Appl. Math. 12, 233--239 (1985; Zbl 0588.05037) Full Text: DOI
Lai, Ten-Hwang; Sprague, Alan On the complexity of a family of generalized matching problems. (English) Zbl 0582.68014 Discrete Appl. Math. 12, 303-318 (1985). MSC: 68Q25 05C70 PDFBibTeX XMLCite \textit{T.-H. Lai} and \textit{A. Sprague}, Discrete Appl. Math. 12, 303--318 (1985; Zbl 0582.68014) Full Text: DOI