Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("MAO CHENG CAI")

Results 1 to 8 of 8

  • Page / 1
Export

Selection :

  • and

On some factor theorems of graphsMAO-CHENG CAI.Discrete mathematics. 1991, Vol 98, Num 3, pp 223-229, issn 0012-365XArticle

An algorithm for an Eulerian trail traversing specified edges in given orderMAO-CHENG CAI.Discrete applied mathematics. 1994, Vol 55, Num 3, pp 233-239, issn 0166-218XArticle

An algorithm for optimum common root functions of two digraphsMAO-CHENG CAI.Discrete mathematics. 1993, Vol 119, Num 1-3, pp 13-20, issn 0012-365XArticle

A remark on the number of vertices of degree k in a minimally k-edge-connected graphMAO-CHENG CAI.Discrete mathematics. 1992, Vol 104, Num 3, pp 221-226, issn 0012-365XArticle

The maximal size of graphs with at most k edge-joint paths connecting any two adjacent verticesMAO-CHENG CAI.Discrete mathematics. 1990, Vol 85, Num 1, pp 43-52, issn 0012-365X, 10 p.Article

Tne number of vertices of degree k in a minimally k-edge-connected graphMAO-CHENG CAI.Journal of combinatorial theory. Series B. 1993, Vol 58, Num 2, pp 225-239, issn 0095-8956Article

Restricted covering of digraphs with arborescencesMAO-CHENG CAI.Discrete mathematics. 1990, Vol 82, Num 2, pp 143-152, issn 0012-365X, 10 p.Article

A NEW BOUND ON THE LENGTH OF THE SHORTEST STRING CONTAINING ALL R-PERMUTATIONSMAO CHENG CAI.1982; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1982; VOL. 39; NO 3; PP. 329-330; BIBL. 1 REF.Article

  • Page / 1