QUELQUES THEOREMES D'ORIENTATION DES GRAPHES TRANSFORMES EN BASES FORTESMOSESYAN KM.1972; AKAD. NAUK ARM. S.S.R., DOKL.; S.S.S.R.; DA. 1972; VOL. 54; NO 5; PP. 241-245; ABS. ARM.; BIBL. 3 REF.Serial Issue

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

MINIMISATION DU NOMBRE DES INTERSECTIONS DES ARETES D'UN GRAPHEMELIKHOV AN; KUREJCHIK VM; TISHCHENKO VA et al.1971; VYCHISLIT. SIST.; S.S.S.R.; DA. 1971; NO 47; PP. 32-40; BIBL. 5 REF.Serial Issue

A TECHNIQUE FOR GRAPH EMBEDDING WITH CONSTRAINTS ON NODE AND ARC CORRESPONDENCESLEVI G; LUCCIO F.1973; INFORM. SCI.; U.S.A.; DA. 1973; VOL. 5; PP. 1-24; BIBL. 6 REF.Serial Issue

FINDING UNCOMPLEMENTED TREESKLEITMAN DJ.1972; STUD. APPL. MATH.; U.S.A.; DA. 1972; VOL. 51; NO 3; PP. 309-310Serial Issue

ARC COLORINGS OF DIGRAPHSHARNER CC; ENTRINGER RC.1972; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1972; VOL. 13; NO 3; PP. 219-225; BIBL. 4 REF.Serial Issue

FINDING THE N MOST VITAL LINKS IN FLOW NETWORKS.RATLIFF HD; SICILIA GT; LUBORE SH et al.1975; MANAG. SCI.; U.S.A.; DA. 1975; VOL. 21; NO 5; PP. 531-539; BIBL. 8 REF.Article

ESTIMATIONS ASYMPTOTIQUES DU DIAMETRE ET DES NOMBRES D'INDEPENDANCE ET DE DOMINATION D'UN GRAPHE ALEATOIREBURTIN YU D.1973; DOKL. AKAD. NAUK S.S.S.R.; S.S.S.R.; DA. 1973; VOL. 209; NO 4; PP. 765-768; BIBL. 11 REF.Serial Issue

DIGRAPHS MAXIMAL WITH RESPECT TO ARC CONNECTIVITYHORAK P.1982; MATH. SLOV.; ISSN 0139-9918; CSK; DA. 1982; VOL. 32; NO 3; PP. 243-253; ABS. RUS; BIBL. 8 REF.Article

PROBLEME DE TRANSPORT SUR UN RESEAU AVEC AMPLIFICATION DANS LES ARCSKHRANOVICH IL.1979; AVTOMAT. I TELEMEKH.; SUN; DA. 1979; NO 2; PP. 90-99; ABS. ENG; BIBL. 6 REF.Article

ARC GRAPHS AND THEIR POSSIBLE APPLICATION TO SPARSE MATRIX PROBLEMS.RHEINBOLDT WC; MESZTENYI CK.1974; B.I.T.; DANM.; DA. 1974; VOL. 14; NO 2; PP. 227-239; BIBL. 8 REF.Article

TRANSPORTATION NETWORKS WITH RANDOM ARC CAPACITIESDOULLIEZ P; JAMOULLE E.1972; REV. FR. AUTOMAT. INFORMAT. RECH. OPERAT., V; FR.; DA. 1972; VOL. 6; PP. 45-59; BIBL. 4 REF.Serial Issue

Polynomial time recognition of unit circular-arc graphsDURAN, Guillermo; GRAVANO, Agustin; MCCONNELL, Ross M et al.Journal of algorithms (Print). 2006, Vol 58, Num 1, pp 67-78, issn 0196-6774, 12 p.Article

Linear-Time Recognition of Helly Circular-Arc Models and GraphsJOERIS, Benson L; CHIH LIN, Min; MCCONNELL, Ross M et al.Algorithmica. 2011, Vol 59, Num 2, pp 215-239, issn 0178-4617, 25 p.Article

A generalization of the theorem of Lekkerkerker and BolandHELL, Pavol; JING HUANG.Discrete mathematics. 2005, Vol 299, Num 1-3, pp 113-119, issn 0012-365X, 7 p.Article

Diameter and connectivity of 3-arc graphsKNOR, Martin; SANMING ZHOU.Discrete mathematics. 2010, Vol 310, Num 1, pp 37-42, issn 0012-365X, 6 p.Article

Algorithms for clique-independent sets on subclasses of circular-arc graphsDURAN, Guillermo; MIN CHIH LIN; MERA, Sergio et al.Discrete applied mathematics. 2006, Vol 154, Num 13, pp 1783-1790, issn 0166-218X, 8 p.Conference Paper

The clique operator on circular-arc graphsLIN, Min Chih; SOULIGNAC, Francisco J; SZWARCFITER, Jayme L et al.Discrete applied mathematics. 2010, Vol 158, Num 12, pp 1259-1267, issn 0166-218X, 9 p.Conference Paper

UNIT CIRCULAR-ARC GRAPH REPRESENTATIONS AND FEASIBLE CIRCULATIONSMIN CHIH LIN; SZWARCFITER, Jayme L.SIAM journal on discrete mathematics (Print). 2009, Vol 22, Num 1, pp 409-423, issn 0895-4801, 15 p.Article

Finding a maximum matching in a circular-arc graphLIANG, Y. D; RHEE, C.Information processing letters. 1993, Vol 45, Num 4, pp 185-190, issn 0020-0190Article

List homomorphisms of graphs with bounded degreesFEDER, Tomas; HELL, Pavol; JING HUANG et al.Discrete mathematics. 2007, Vol 307, Num 3-5, pp 386-392, issn 0012-365X, 7 p.Article

Locally connected spanning trees in strongly chordal graphs and proper circular-arc graphsLIN, Ching-Chi; CHANG, Gerard J; CHEN, Gen-Huey et al.Discrete mathematics. 2007, Vol 307, Num 2, pp 208-215, issn 0012-365X, 8 p.Article

ASSIGNMENT OF TASKS IN A DISTRIBUTED PROCESSOR SYSTEM WITH LIMITED MEMORY = AFFECTATION DE TACHES DANS UN SYSTEME DE PROCESSEURS REPARTIS A MEMOIRE LIMITEERAO GS; STONE HS; HU TC et al.1979; IEEE TRANS. COMPUTERS; USA; DA. 1979; VOL. 28; NO 4; PP. 291-299; BIBL. 18 REF.Article

The single most vital arc in the most economical path problem: a parametric analysisKAO-CHENG LIN; MAW-SHENG CHERN.Computers & operations research. 1994, Vol 21, Num 3, pp 353-358, issn 0305-0548Article

Improving the location of minimax facilities through network modificationBERMAN, O; INGCO, D. I; ODONI, A et al.Networks (New York, NY). 1994, Vol 24, Num 1, pp 31-41, issn 0028-3045Article