ALGORITHMUS ZUR BESTIMMUNG VON ABSTAENDEN IN ENDLICHEN, GERICHTETEN UND UNBEWERTETEN GRAPHEN = UN ALGORITHME POUR CALCULER LES DISTANCES DANS LES GRAPHES FINIS ORIENTES ET NON VALUESBAUERSFELD G; ESSMANN C; LOHLE H et al.1972; COMPUTING; AUSTR.; DA. 1972; VOL. 10; NO 1-2; PP. 107-109; ABS. ANGLSerial Issue

DEGREES OF VERTICES IN A FRIENSSHIP GRAPH.KOTZIG A.1975; BULL. CANAD. MATH.; CANADA; DA. 1975; VOL. 18; NO 5; PP. 691-693; BIBL. 3 REF.Article

A SIMPLE PROOF OF A FORMULA OF DERSHOWITZ AND ZAKSRUSKEY F.1983; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1983; VOL. 43; NO 1; PP. 117-118; BIBL. 4 REF.Article

GRAPHS WHOSE EVERY INDEPENDENT SET HAS A COMMON NEIGHBOURPACH J.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 37; NO 2-3; PP. 217-228; BIBL. 7 REF.Article

UEBER N-FACH ZUSAMMENHAENGENDE ECKENMENGEN IN GRAPHEN. = SUR DES ENSEMBLES DE NOEUDS N-CONNEXES DANS DES GRAPHESMADER W.1978; J. COMBINATOR THEORY; USA; DA. 1978; VOL. 25; NO 1; PP. 74-93; ABS. ENG; BIBL. 15 REF.Article

UPPER BOUNDS FOR THE STABILITY NUMBER OF A GRAPHHANSEN P.1979; REV. ROUMAINE MATH. PURES APPL.; ROM; DA. 1979; VOL. 24; NO 8; PP. 1195-1199; BIBL. 6 REF.Article

KONVEXITAET UND OPTIMIERUNG IN METRISCHEN GRAPHEN. = CONVEXITE ET OPTIMISATION DANS LES GRAPHES METRIQUESDEWESS G.1976; WISSENSCH. Z. TECH. HOCHSCH. ILMENAU; DTSCH.; DA. 1976; VOL. 22; NO 5; PP. 43-59; BIBL. 8 REF.Article

EDGE DISJOINT PLACEMENT OF GRAPHSSAUER N; SPENCER J.1978; J. COMBINATOR. THEORY, B; USA; DA. 1978; VOL. 25; NO 3; PP. 295-302; BIBL. 3 REF.Article

A NOTE ON COMPACT SETS IN GRAPHSLODI E; LUCCIO F.1978; RIC. DI AUTOMAT.; ITA; DA. 1978; VOL. 9; NO 1; PP. 86-91; BIBL. 1 REF.Article

THE LARGEST VERTEX DEGREE SUM FOR A TRIANGLE IN A GRAPH.EDWARDS CS.1977; BULL. LONDON MATH. SOC.; G.B.; DA. 1977; VOL. 9; NO 26; PP. 203-208; BIBL. 1 REF.Article

FORMULES ASYMPTOTIQUES POUR LA PROBABILITE DE K-CONNEXITE DES GRAPHES ALEATOIRESKEL'MANS AK.1972; TEOR. VEROJAT. PRIMEN.; S.S.S.R.; DA. 1972; VOL. 17; NO 2; PP. 253-265; ABS. ANGL.; BIBL. 12 REF.Serial Issue

ON PROBLEMS RELATED TO CHARACTERISTIC VERTICES OF GRAPHSSZAMKOLOWICZ L.1979; COLLOQ. MATH.; POL; DA. 1979; VOL. 42; PP. 367-375; BIBL. 3 REF.Article

DISJOINT TRIPLES IN A 3-GRAPH WITH GIVEN, MAXIMAL DEGREE.BOLLOBAS B.1977; QUART. J. MATH.; G.B.; DA. 1977; VOL. 28; NO 109; PP. 81-85; BIBL. 9 REF.Article

LINE REMOVAL ALGORITHMS FOR GRAPHS AND THEIR DEGREE LISTS.BOESCH F; HARARY F.1976; I.E.E.E. TRANS. CIRCUITS SYST.; U.S.A.; DA. 1976; VOL. 23; NO 12; PP. 778-782; BIBL. 13 REF.Article

PARTITIONS OF VERTICES.NESETRIL J; RODL V.1976; COMMENT. MATH. UNIV. CAROLINAE; CESKOSL.; DA. 1976; VOL. 17; NO 1; PP. 85-95; BIBL. 10 REF.Article

AN ALGORITHM FOR ENUMERATING ALL VERTICES OF A CONVEX POLYHEDRON.ALTHERR W.1975; COMPUTING; AUSTR.; DA. 1975; VOL. 15; NO 3; PP. 181-193; ABS. ALLEM.; BIBL. 11 REF.Article

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

ON MINIMAL 5-CHROMATIC TRIANGLE-FREE GRAPHSAVIS D.1979; J. GRAPH THEORY; USA; DA. 1979; VOL. 3; NO 4; PP. 397-400; BIBL. 5 REF.Article

A PREPROCESSOR FOR ALGORITHMS TO DETERMINE MINIMUM FEEDBACK VERTEX SETSZNOTINAS NM; ROE PH.1979; ICCS 79. INTERNATIONAL CONFERENCE ON CYBERNETICS AND SOCIETY/1979/DENVER CO; USA; NEW YORK: IEEE; DA. 1979; PP. 409-412; BIBL. 6 REF.Conference Paper

COMPUTING A GRAPH'S PERIOD QUADRICALLY BY NODE CONDENSATIONBALCER Y; VEINOTT AF JR.1973; DISCRETE MATH.; NETHERL.; DA. 1973; VOL. 4; NO 4; PP. 295-303; BIBL. 8 REF.Serial Issue

THE COHESIVENESS OF A POINT OF GRAPHAKIYAMA J; BOESCH F; ERA H et al.1981; NETWORKS; ISSN 0028-3045; USA; DA. 1981; VOL. 11; NO 1; PP. 65-68; BIBL. 2 REF.Article

A LINEAR-TIME APPROXIMATION ALGORITHM FOR THE WEIGHTED VERTEX COVER PROBLEMBAR YEHUDA R; EVEN S.1981; J. ALGORITHMS; ISSN 0196-6774; USA; DA. 1981; VOL. 2; NO 2; PP. 198-203; BIBL. 6 REF.Article

VERTEX COLORINGS WITHOUT ISOLATESMAURER SB.1979; J. COMBINATOR. THEORY, B; USA; DA. 1979; VOL. 27; NO 3; PP. 294-319; BIBL. 12 REF.Article

VERTEX DEGREES OF PLANAR GRAPHSCOOK RJ.1979; J. COMBINATOR. THEORY, B; USA; DA. 1979; VOL. 26; NO 3; PP. 337-345; BIBL. 1 REF.Article

ENUMERATING A CLASS OF NESTED GROUP TESTING PROCEDURES.MOON JW; SOBEL M.1977; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1977; VOL. 23; NO 2-3; PP. 184-188; BIBL. 3 REF.Article