The maximum number of maximal independent sets in unicyclic connected graphsKOH, K. M; GOH, C. Y; DONG, F. M et al.Discrete mathematics. 2008, Vol 308, Num 17, pp 3761-3769, issn 0012-365X, 9 p.Article

The number of independent sets in unicyclic graphs with a given diameterSHUCHAO LI; ZHONGXUN ZHU.Discrete applied mathematics. 2009, Vol 157, Num 7, pp 1387-1395, issn 0166-218X, 9 p.Article

Parallel algorithms for fractional and maximal independent sets in planar graphsDADOUN, N; KIRKPATRICK, D. G.Discrete applied mathematics. 1990, Vol 27, Num 1-2, pp 69-83, issn 0166-218XConference Paper

Essential independent sets and long cyclesHIROHATA, Kazuhide.Discrete mathematics. 2002, Vol 250, Num 1-3, pp 109-123, issn 0012-365XArticle

A simple proof of an inequality connecting the alternating number of independent sets and the decycling numberLEVIT, Vadim E; MANDRESCU, Eugen.Discrete mathematics. 2011, Vol 311, Num 13, pp 1204-1206, issn 0012-365X, 3 p.Conference Paper

On the unimodality of the independent set numbers of a class of matroidsMAHONEY, C.Journal of combinatorial theory. Series B. 1985, Vol 39, Num 1, pp 77-85, issn 0095-8956Article

A new simple algorithm for the maximum-weight independent set problem on circle graphsVALIENTE, Gabriel.Lecture notes in computer science. 2003, pp 129-137, issn 0302-9743, isbn 3-540-20695-7, 9 p.Conference Paper

MEASURES ON INDEPENDENT SETS, A QUANTITATIVE VERSION OF RUDIN'S THEOREMKÖRNER, T. W.Proceedings of the American Mathematical Society. 2007, Vol 135, Num 12, pp 3823-3832, issn 0002-9939, 10 p.Article

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

A simple NC-algorithm for a maximal independent set in a hypergraph of poly-log arboricityGARRIDO, O; KELSEN, P; LINGAS, A et al.Information processing letters. 1996, Vol 58, Num 2, pp 55-58, issn 0020-0190Article

On approximation problems related to the independent set and vertex cover problemsBAR-YEHUDA, R; MORAN, S.Discrete applied mathematics. 1984, Vol 9, Num 1, pp 1-10, issn 0166-218XArticle

A simple linear time algorithm for finding a maximum independent set of circular arcs using intervals aloneMANACHER, Glenn K; MANKUS, Terrance A.Networks (New York, NY). 2002, Vol 39, Num 2, pp 68-72, issn 0028-3045Article

FINDING AN INDEPENDENT SET IN A PLANAR GRAPH.ALBERTSON MO.1974; LECTURE NOTES MATH.; GERM.; DA. 1974; NO 406; PP. 173-179; BIBL. 4 REF.; (GRAPHS AND COMB. PROC. CAP. CONF. GRAPH THEORY COMB.; WASHINGTON; 1973)Conference Paper

The cardinality of the collection of maximum independent sets of a functional graphCHANG, S.-C; YEH, Y.-N.Advances in applied mathematics (Print). 1997, Vol 18, Num 3, pp 286-299, issn 0196-8858Article

The structure of (t, r)-regular graphs of large orderJAMISON, Robert E; JOHNSON, Peter D.Discrete mathematics. 2003, Vol 272, Num 2-3, pp 297-300, issn 0012-365X, 4 p.Article

The number of independent sets in a grid graphCALKIN, N. J; WILF, H. S.SIAM journal on discrete mathematics (Print). 1998, Vol 11, Num 1, pp 54-60, issn 0895-4801Article

Independent sets in graphs with trianglesHOFMEISTER, T; LEFMANN, H.Information processing letters. 1996, Vol 58, Num 5, pp 207-210, issn 0020-0190Article

An independent dominating set in the complement of a minimum dominating set of a treeHENNING, Michael A; LÖWENSTEIN, Christian; RAUTENBACH, Dieter et al.Applied mathematics letters. 2010, Vol 23, Num 1, pp 79-81, issn 0893-9659, 3 p.Article

A processor efficient MIS algorithm on random graphsYANG, S. B; DHALL, S. K; LAKSHMIVARAHAN, S et al.Information processing letters. 1994, Vol 49, Num 3, pp 157-163, issn 0020-0190Article

Cacti with the maximum Merrifield-Simmons index and given number of cut edgesMAOLIN WANG.Applied mathematics letters. 2010, Vol 23, Num 12, pp 1416-1420, issn 0893-9659, 5 p.Article

On-line computation and maximum-weighted hereditary subgraph problemsDEMANGE, Marc; KOUAKOU, Bernard; SOUTIF, Eric et al.Lecture notes in computer science. 2005, pp 433-442, issn 0302-9743, isbn 3-540-30935-7, 1Vol, 10 p.Conference Paper

Complete arcs in inversive planes over prime fieldsHADNAG, Eva; SONNINO, Angelo.Discrete mathematics. 2002, Vol 255, Num 1-3, pp 181-188, issn 0012-365XConference Paper

Triangle-free graphs whose independence number equals the degreeBRANDT, Stephan.Discrete mathematics. 2010, Vol 310, Num 3, pp 662-669, issn 0012-365X, 8 p.Conference Paper

Solving maximum independent set by asynchronous distributed hopfield-type neural networksGROSSI, Giuliano; MARCHI, Massimo; POSENATO, Roberto et al.Informatique théorique et applications (Imprimé). 2006, Vol 40, Num 2, pp 371-388, issn 0988-3754, 18 p.Article

A note on maximum independent set and related problems on box graphsLINGAS, Andrzej; WAHLEN, Martin.Information processing letters. 2005, Vol 93, Num 4, pp 169-171, issn 0020-0190, 3 p.Article