Profile scheduling of opposing forests and level ordersDOLEV, D; WARMUTH, M. K.SIAM journal on algebraic and discrete methods. 1985, Vol 6, Num 4, pp 665-687, issn 0196-5212Article

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

Fractional covers for forests and matchingsPADBERG, M. W; WOLSEY, L. A.Mathematical programming. 1984, Vol 29, Num 1, pp 1-14, issn 0025-5610Article

Induced forests in cubic graphsSTATON, W.Discrete mathematics. 1984, Vol 49, Num 2, pp 175-178, issn 0012-365XArticle

On operator and formal sum methods for graph enumeration problemsLIU, C. J; YUTZE CHOW.SIAM journal on algebraic and discrete methods. 1984, Vol 5, Num 3, pp 384-406, issn 0196-5212Article

On the reconstruction of rayless infinite forestsANDREAE, T; SCHMIDT, R.Journal of graph theory. 1984, Vol 8, Num 3, pp 405-422, issn 0364-9024Article

On the linear vertex-arboricity of a planar graphPOH, K. S.Journal of graph theory. 1990, Vol 14, Num 1, pp 73-75, issn 0364-9024Article

Distributions limites de la hauteur d'une forêt aléatoirePAVLOV, YU. L.Teoriâ verojatnostej i eë primeneniâ. 1983, Vol 28, Num 3, pp 449-457, issn 0040-361XArticle

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

Forest iteration method for stochastic transportation problemLIQUN QI.Mathematical programming study. 1985, Num 25, pp 142-163, issn 0303-3929Article

A COMBINATORIAL PROOF OF THE ALL MINORS MATRIX TREE THEOREMCHAIKEN S.1982; SIAM J. ALGEBR. DISCRETE METHODS; ISSN 0196-5212; USA; DA. 1982; VOL. 3; NO 3; PP. 319-329; BIBL. 27 REF.Article

A LINEAR ALGORITHM TO DETERMINE MINIMAL SPANNING FORESTS IN CHAIN GRAPHSLUCCIO F; PAGLI L.1982; INF. PROCESS. LETT.; ISSN 0020-0190; NLD; DA. 1982; VOL. 15; NO 1; PP. 1-4; BIBL. 3 REF.Article

GENERATION OF TREES, COTREES AND 2-TREES OF A LINEAR GRAPHCAHIT R; CAHIT I.1972; PROC. INSTIT. ELECTR. ENGRS; G.B.; DA. 1972; VOL. 119; NO 9; PP. 1275-1277; BIBL. 19 REF.Serial Issue

ON THE RECONSTRUCTION OF COUNTABLE FORESTSHARARY F; SCHWENK AJ; SCOTT RL et al.1972; PUBL. INST. MATH.; YOUGOSL.; DA. 1972; VOL. 13; PP. 39-42; BIBL. 9 REF.Serial Issue

FOREST DECOMPOSITIONS OF LADDERSFARRELL EJ.1983; DISCRETE MATHEMATICS; ISSN 0012-365X; NLD; DA. 1983; VOL. 44; NO 3; PP. 267-274; BIBL. 4 REF.Article

A STATUS ON THE LINEAR ARBORICITYAKIYAMA J.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; VOL. 108; PP. 38-44; BIBL. 16 REF.Conference Paper

BICIRCULAR GEOMETRY AND THE LATTICE OF FORESTS OF A GRAPHZASLAVSKY T.1982; Q. J. MATH.; ISSN 0033-5606; GBR; DA. 1982; VOL. 33; NO 132; PP. 493-511; BIBL. 17 REF.Article

SUR LE NOMBRE DE SAUTS D'UNE FORETCHEIN M; MARTIN P.1972; C. R. ACAD. SCI., A; FR.; DA. 1972; VOL. 275; NO 3; PP. 159-161; BIBL. 3 REF.Serial Issue

ENUMERATION OF FORESTS IN A GRAPHLIU CJ; YUTZE CHOW.1981; PROC. AM. MATH. SOC.; ISSN 0002-9939; USA; DA. 1981; VOL. 83; NO 3; PP. 659-662; BIBL. 2 REF.Article

COUNTING STABLE TREES.MCAVANEY KL.1974; LECTURE NOTES MATH.; GERM.; DA. 1974; NO 403; PP. 79-85; BIBL. 13 REF.; (COMB. MATH. PROC. 2ND AUST. CONF.; MELBOURNE; 1973)Conference Paper

An efficient NC algorithm for a sparse k-edge-connectivity certificateNAGAMOCHI, Hiroshi; HASUNUMA, Toru.Journal of algorithms (Print). 2001, Vol 38, Num 2, pp 354-373, issn 0196-6774Article

SIMPLER COUNTEREXAMPLES TO THE EDGE-RECONSTRUCTION CONJECTURE FOR INFINITE GRAPHSANDREAE T.1982; J. COMB. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1982; VOL. 32; NO 3; PP. 258-263; BIBL. 10 REF.Article

SUBGRAPHS SMALLER THAN THE GIRTHSIMONCINI L; TAYLOR H.1980; J. GRAPH THEORY; USA; DA. 1980; VOL. 4; NO 1; PP. 101-105; BIBL. 6 REF.Article

A NOTE ON ABEL POLYNOMIALS AND ROOTED LABELED FORESTSSAGAN BE.1983; DISCRETE MATHEMATICS; ISSN 0012-365X; NLD; DA. 1983; VOL. 44; NO 3; PP. 293-298; BIBL. 8 REF.Article

ON THE DIMENSION OF TREESPOLJAK S; PULTR A.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 34; NO 2; PP. 165-171; BIBL. 8 REF.Article