Smaller Kernels for hitting set problems of constant arityNISHIMURA, Naomi; RAGDE, Prabhakar; THILIKOS, Dimitrios M et al.Lecture notes in computer science. 2004, pp 121-126, issn 0302-9743, isbn 3-540-23071-8, 6 p.Conference Paper

Homological coverings of graphsGIGGS, N. L.Journal of the London Mathematical Society. 1984, Vol 30, Num 1, pp 1-14, issn 0024-6107Article

Covering of graphs by complete bipartite subgraphs; Complexity of 0-1 matricesTUZA, Z.Combinatorica (Print). 1984, Vol 4, Num 1, pp 111-116, issn 0209-9683Article

A note on counting connected graph covering projectionsHOFMEISTER, M.SIAM journal on discrete mathematics (Print). 1998, Vol 11, Num 2, pp 286-292, issn 0895-4801Article

Shortest coverings of graphs with cyclesBERMOND, J. C; JACKSON, B; JAEGER, F et al.Journal of combinatorial theory. Series B. 1983, Vol 35, Num 3, pp 297-308, issn 0095-8956Article

Covering and coloring problems for relatives of intervalsGYARFAS, A; LEHEL, J.Discrete mathematics. 1985, Vol 55, Num 2, pp 167-180, issn 0012-365XArticle

Fractional matchings and covers in infinite hypergraphsAHARONI, R.Combinatorica (Print). 1985, Vol 5, Num 3, pp 181-184, issn 0209-9683Article

Packing and covering of crossing families of cutsSCHRIJVER, A.Journal of combinatorial theory. Series B. 1983, Vol 35, Num 2, pp 104-128, issn 0095-8956Article

Isomorphism classes of graph bundlesJIN HO KWAK; JAEUN LEE.Canadian journal of mathematics. 1990, Vol 42, Num 4, pp 747-761, issn 0008-414X, 15 p.Article

The complexity of generalized clique coveringCORNELL, D. G; FONLUPT, J.Discrete applied mathematics. 1988, Vol 22, Num 2, pp 109-118, issn 0166-218XArticle

Algorithmes asymptotiquement exacts de résolution d'un problème multicritère de recouvrement d'un graphe par des circuitsKOCHKAROV, A. M.Vesci Akademii navuk BSSR. Seryâ fizika-matematyčnyh navuk. 1985, Num 4, pp 39-43, issn 0002-3574Article

NP-completeness of some problems of partitioning and covering in graphsPEROCHE, B.Discrete applied mathematics. 1984, Vol 8, Num 2, pp 195-208, issn 0166-218XArticle

Nowhere zero flow and circuit covering in regular matroidsTARSI, M.Journal of combinatorial theory. Series B. 1985, Vol 39, Num 3, pp 346-352, issn 0095-8956Article

Ear-decompositions of matching-covered graphsLOVASZ, L.Combinatorica (Print). 1983, Vol 3, Num 1, pp 105-117, issn 0209-9683Article

Graphs with relations, coverings and group-graded algebrasGREEN, E. L.Transactions of the American Mathematical Society. 1983, Vol 279, Num 1, pp 297-310, issn 0002-9947Article

A better approximation ratio for the vertex cover problemKARAKOSTAS, George.Lecture notes in computer science. 2005, pp 1043-1050, issn 0302-9743, isbn 3-540-27580-0, 8 p.Conference Paper

Parameterized complexity of generalized vertex cover problemsJIONG GUO; NIEDERMEIER, Rolf; WERNICKE, Sebastian et al.Lecture notes in computer science. 2005, pp 36-48, issn 0302-9743, isbn 3-540-28101-0, 13 p.Conference Paper

Graph spannersPELEG, D; SCHÄFFER, A. A.Journal of graph theory. 1989, Vol 13, Num 1, pp 99-116, issn 0364-9024Article

Extension of a clique cover result to uniform hypergraphsSHELTON, A. P; DUTTON, R. D; BRIGHAM, R. C et al.Discrete mathematics. 1986, Vol 59, Num 1-2, pp 199-201, issn 0012-365XArticle

A remark on covering graphsHOLUB, P; RIVAL, I.Order (Dordrecht). 1985, Vol 2, Num 3, pp 321-322, issn 0167-8094Article

A common cover of graphs and 2-cell embeddingsMOHAR, B.Journal of combinatorial theory. Series B. 1986, Vol 40, Num 1, pp 94-106, issn 0095-8956Article

Problème multicritère de recouvrement d'un graphe par des circuits de grande et de petite tailleKOCHKAROV, A. M; PEREPELITSA, V. A.Vesci Akademii navuk BSSR. Seryâ fizika-matematyčnyh navuk. 1985, Num 5, pp 39-44, issn 0002-3574Article

Upper bounds on the edge clique cover number of a graphBRIGHAM, R. C; DUTTON, R. D.Discrete mathematics. 1984, Vol 52, Num 1, pp 31-37, issn 0012-365XArticle

Covering vertices of a graph by k disjoint cyclesEGAWA, Yoshimi; HAGITA, Mariko; KAWARABAYASHI, Ken-Ichi et al.Discrete mathematics. 2003, Vol 270, Num 1-3, pp 115-125, issn 0012-365X, 11 p.Article

A compactness result for perfect matchingsPOLAT, N.Discrete mathematics. 1987, Vol 64, Num 2-3, pp 229-237, issn 0012-365XArticle