Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("ARC GRAPHE")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 68

  • Page / 3
Export

Selection :

  • and

HAMILTONIAN ARCS IN SELF-COMPLEMENTARY GRAPHS.CLAPHAM CRJ.1974; DISCRETE MATH.; NETHERL.; DA. 1974; VOL. 8; NO 3; PP. 251-255; BIBL. 4 REF.Article

MINIMAL K-ARC CONNECTED GRAPHSFULKERSON DR; SHAPLEY LS.1972; NETWORKS; U.S.A.; DA. 1972; VOL. 1; NO 1; PP. 91-98; BIBL. 4 REF.Serial Issue

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

Characterizations and recognition of circular-arc graphs and subclasses: A surveyLIN, Min Chih; SZWARCFITER, Jayme L.Discrete mathematics. 2009, Vol 309, Num 18, pp 5618-5635, issn 0012-365X, 18 p.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

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

NOMBRE D'ARCS DANS LES GRAPHES K-ARC-FORTEMENT CONNEXES MINIMAUX.DALMAZZO M.1977; C.R. ACAD. SCI., A; FR.; DA. 1977; VOL. 285; NO 5; PP. 341-344; ABS. ANGL.; BIBL. 5 REF.Article

MINIMUM NODE DISJOINT PATH COVERING FOR CIRCULAR-ARC GRAPHSBONUCELLI MA; BOVET DP.1979; INFORM. PROCESSG LETTERS; NLD; DA. 1979; VOL. 8; NO 4; PP. 159-161; BIBL. 6 REF.Article

CROSSING NUMBER PROBLEMSERDOS P; GUY RK.1973; AMER. MATH. MONTH.; U.S.A.; DA. 1973; VOL. 80; NO 1; PP. 52-58; BIBL. 22 REF.Serial Issue

DETERMINING THE MOST VITAL LINK IN A FLOW NETWORKLUBORE SH; RATLIFF HD; SICILIA GT et al.1972; NAV. RES. LOGIST. QUART.; U.S.A.; DA. 1972; VOL. 18; NO 4; PP. 497-502; BIBL. 3 REF.Serial 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

MINIMUM COST MULTICOMMODITY CIRCULATION PROBLEM WITH CONVEX ARC-COSTS.FERLAND JA.1974; TRANSPORT. SCI.; U.S.A.; DA. 1974; VOL. 8; NO 4; PP. 355-360; BIBL. 9 REF.Article

AN ALGORITHM FOR THE STEINER PROBLEM IN GRAPHSSHORE ML; FOULDS LR; GIBBONS PB et al.1982; NETWORKS; ISSN 0028-3045; USA; DA. 1982; VOL. 12; NO 3; PP. 323-333; BIBL. 18 REF.Article

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

The structure of bi-arc treesFEDER, Tomas; HELL, Pavol; JING HUANG et al.Discrete mathematics. 2007, Vol 307, Num 3-5, pp 393-401, issn 0012-365X, 9 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

  • Page / 3