Hell, Pavol; Kirkpatrick, David Linear-time certifying algorithms for near-graphical sequences. (English) Zbl 1185.05135 Discrete Math. 309, No. 18, 5703-5713 (2009). MSC: 05C85 05C70 05C07 68R10 PDFBibTeX XMLCite \textit{P. Hell} and \textit{D. Kirkpatrick}, Discrete Math. 309, No. 18, 5703--5713 (2009; Zbl 1185.05135) Full Text: DOI
Hell, Pavol; Kirkpatrick, David; Li, Brenda Rounding in symmetric matrices and undirected graphs. (English) Zbl 0920.05062 Discrete Appl. Math. 70, No. 1, 1-21 (1996). MSC: 05C85 05C50 05C70 68R10 05C38 05C05 PDFBibTeX XMLCite \textit{P. Hell} et al., Discrete Appl. Math. 70, No. 1, 1--21 (1996; Zbl 0920.05062) Full Text: DOI
Hell, P.; Kirkpatrick, D. G. Algorithms for degree constrained graph factors of minimum deficiency. (English) Zbl 0764.68118 J. Algorithms 14, No. 1, 115-138 (1993). MSC: 68R10 05C70 05C35 90B10 PDFBibTeX XMLCite \textit{P. Hell} and \textit{D. G. Kirkpatrick}, J. Algorithms 14, No. 1, 115--138 (1993; Zbl 0764.68118) Full Text: DOI
Heinrich, Katherine; Hell, Pavol; Kirkpatrick, David G.; Liu, Guizhen A simple existence criterion for \((g<f)\)-factors. (English) Zbl 0723.05101 Discrete Math. 85, No. 3, 313-317 (1990). Reviewer: Ma Zhongfan (Beijing) MSC: 05C70 PDFBibTeX XMLCite \textit{K. Heinrich} et al., Discrete Math. 85, No. 3, 313--317 (1990; Zbl 0723.05101) Full Text: DOI
Hell, Pavol; Kirkpatrick, David; Kratochvíl, Jan; Kříž, Igor On restricted two-factors. (English) Zbl 0672.05065 SIAM J. Discrete Math. 1, No. 4, 472-484 (1988). MSC: 05C70 05C38 05C99 PDFBibTeX XMLCite \textit{P. Hell} et al., SIAM J. Discrete Math. 1, No. 4, 472--484 (1988; Zbl 0672.05065) Full Text: DOI
Hell, P.; Kirkpatrick, D. G. Packings by complete bipartite graphs. (English) Zbl 0597.05050 SIAM J. Algebraic Discrete Methods 7, 199-209 (1986). MSC: 05C70 68R10 PDFBibTeX XMLCite \textit{P. Hell} and \textit{D. G. Kirkpatrick}, SIAM J. Algebraic Discrete Methods 7, 199--209 (1986; Zbl 0597.05050) Full Text: DOI
Fraisse, Pierre; Hell, Pavol; Kirkpatrick, David G. A note on f-factors in directed and undirected multigraphs. (English) Zbl 0594.05053 Graphs Comb. 2, 61-66 (1986). MSC: 05C70 05C99 PDFBibTeX XMLCite \textit{P. Fraisse} et al., Graphs Comb. 2, 61--66 (1986; Zbl 0594.05053) Full Text: DOI
Hell, P.; Kirkpatrick, D. G. Packings by cliques and by finite families of graphs. (English) Zbl 0582.05046 Discrete Math. 49, 45-59 (1984). MSC: 05C70 05C35 68R10 PDFBibTeX XMLCite \textit{P. Hell} and \textit{D. G. Kirkpatrick}, Discrete Math. 49, 45--59 (1984; Zbl 0582.05046) Full Text: DOI Backlinks: MO
Kirkpatrick, D. G.; Hell, P. On the complexity of general graph factor problems. (English) Zbl 0525.68023 SIAM J. Comput. 12, 601-609 (1983). MSC: 68Q25 68R10 05C70 PDFBibTeX XMLCite \textit{D. G. Kirkpatrick} and \textit{P. Hell}, SIAM J. Comput. 12, 601--609 (1983; Zbl 0525.68023) Full Text: DOI
Hell, P.; Kirkpatrick, D. G. Scheduling, matching, and coloring. (English) Zbl 0474.05054 Algebraic methods in graph theory, Vol. I, Conf. Szeged 1978, Colloq. Math. Soc. Janos Bolyai 25, 273-279 (1981). MSC: 05C99 03D15 68Q25 05-03 PDFBibTeX XML
Hell, P.; Kirkpatrick, D. G. On generalized matching problems. (English) Zbl 0454.68077 Inf. Process. Lett. 12, 33-35 (1981). MSC: 68R10 05C70 68Q25 PDFBibTeX XMLCite \textit{P. Hell} and \textit{D. G. Kirkpatrick}, Inf. Process. Lett. 12, 33--35 (1981; Zbl 0454.68077) Full Text: DOI
Kirkpatrick, David G.; Hell, Pavol On the completeness of a generalized matching problem. (English) Zbl 1282.68182 Proceedings of the 10th annual ACM symposium on theory of computing, STOC’78, San Diego, CA, USA, May 1–3, 1978. New York, NY: Association for Computing Machinery (ACM). 240-245 (1978). MSC: 68R10 05C70 05C07 PDFBibTeX XMLCite \textit{D. G. Kirkpatrick} and \textit{P. Hell}, in: Proceedings of the 10th annual ACM symposium on theory of computing, STOC'78, San Diego, CA, USA, May 1--3, 1978. New York, NY: Association for Computing Machinery (ACM). 240--245 (1978; Zbl 1282.68182) Full Text: DOI