Minimum cost K-forest coversBAAS, S. M; ORESTES CERDEIRA, J.Mathematical methods of operations research (Heidelberg). 1996, Vol 44, Num 2, pp 255-265, issn 1432-2994Article

Matroids and a forest cover problemORESTES CERDEIRA, J.Mathematical programming. 1994, Vol 66, Num 3, pp 403-405, issn 0025-5610Article

k-Connectivity and decomposition of graph into forestsNISHIZEKI, T; POLJAK, S.Discrete applied mathematics. 1994, Vol 55, Num 3, pp 295-301, issn 0166-218XArticle

Studies on hypergraphs. I: hyperforestsZHANG, L.Discrete applied mathematics. 1993, Vol 42, Num 1, pp 95-112, issn 0166-218XArticle

Fractals arithmétiques = Arithmetic fractalsLong, Lun-Hai; Reveillès, Jean-Pierre.1993, 113 p.Thesis

An enumerating function for spanning forests with color restrictionsBAPAT, R. B; CONSTANTINE, G.Linear algebra and its applications. 1992, Vol 173, pp 231-237, issn 0024-3795Article

Sur les distributions du nombre de sommets dans les couches d'une forêt aléatoirePAVLOV, YU. L.Teoriâ verojatnostej i eë primeneniâ. 1988, Vol 33, Num 1, pp 105-114, issn 0040-361XArticle

Morphological segmentation produces a Voronoï tesselation of the markersMEYER, Fernand.International Conference on Image Processing. 2004, isbn 0-7803-8554-3, 5Vol, Vol5, 3077-3080Conference Paper

Multicolored forests in bipartite decompositions of graphsALON, N; BRUALDI, R. A; SHADER, B. L et al.Journal of combinatorial theory. Series B. 1991, Vol 53, Num 1, pp 143-148, issn 0095-8956Article

Generalized local colorings of graphsTRUSZCZYNSKI, M.Journal of combinatorial theory. Series B. 1992, Vol 54, Num 2, pp 178-188, issn 0095-8956Article

Finding a noncrossing Steiner forest in plane graphs under a 2-face conditionKUSAKARI, Yoshiyuki; MASUBUCHI, Daisuke; NISHIZEKI, Takao et al.Journal of combinatorial optimization. 2001, Vol 5, Num 2, pp 249-266, issn 1382-6905Article

Some approximation results for the maximum agreement forest problemRODRIGUES, Estela Maris; SAGOT, Marie-France; WAKABAYASHI, Yoshiko et al.Lecture notes in computer science. 2001, pp 159-169, issn 0302-9743, isbn 3-540-42470-9Conference Paper

Simple planar graph partition into three forestsGROSSI, R; LODI, E.Discrete applied mathematics. 1998, Vol 84, Num 1-3, pp 121-132, issn 0166-218XArticle

A generalized chromatic polynomial, acyclic orientations with prescribed sources and sinks, and network reliabilityRODRIGUEZ, J; SATYANARAYANA, A.Discrete mathematics. 1993, Vol 112, Num 1-3, pp 185-197, issn 0012-365XArticle

On the optimal stochastic scheduling of out-forestsCOFFMAN, E. G.Operations research. 1992, Vol 40, pp S67-S75, issn 0030-364X, SUP1Article

Alphabetic tree relationsBOZAPALIDIS, S.Theoretical computer science. 1992, Vol 99, Num 2, pp 177-211, issn 0304-3975Article

Another way of counting N^NBENJAMIN, A. T; JUHNKE, F.SIAM journal on discrete mathematics (Print). 1992, Vol 5, Num 3, pp 377-379, issn 0895-4801Article

Factorization forests of finite heightSIMON, I.Theoretical computer science. 1990, Vol 72, Num 1, pp 65-94, issn 0304-3975Article

A note on a new data structure for in-the-past queriesFIELD, D.Information processing letters. 1987, Vol 24, Num 2, pp 95-96, issn 0020-0190Article

Geometry of the uniform spanning forest: Transitions in dimensions 4, 8, 12, ..BENJAMINI, Itai; KESTEN, Harry; PERES, Yuval et al.Annals of mathematics. 2004, Vol 160, Num 2, pp 465-491, issn 0003-486X, 27 p.Article

Linear k-arboricities on treesCHANG, G. J; CHEN, B.-L; FU, H.-L et al.Discrete applied mathematics. 2000, Vol 103, Num 1-3, pp 281-287, issn 0166-218XArticle

Star arboricityALON, N; MCDIARMID, C; REED, B et al.Combinatorica (Print). 1992, Vol 12, Num 4, pp 375-380, issn 0209-9683Article

Decompositions of regular bipartite graphsJACOBSON, M. S; TRUSZCZYNSKI, M; TUZA, Z et al.Discrete mathematics. 1991, Vol 89, Num 1, pp 17-27, issn 0012-365XArticle

Degree sum conditions for oriented forests in digraphsSHENGNING QIAO; SHENGGUI ZHANG.Discrete mathematics. 2009, Vol 309, Num 13, pp 4642-4645, issn 0012-365X, 4 p.Article

Page / 5