Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("GRAPH CONSTRUCTION")

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 486

  • Page / 20
Export

Selection :

  • and

A METHOD FOR THE CONSTRUCTION OF CLASS TWO GRAPHSGOLDBERG MK.1981; SOUTHEASTERN CONFERENCE ON COMBINATORICS, GRAPH THEORY AND COMPUTING. 12/1981/LOUISIANA STATE UNIVERSITY LA; CAN; WINNIPEG: UTILITAS MATHEMATICA PUBLISHING; DA. 1981; PP. 365-374; BIBL. 12 REF.Conference Paper

ON N-EXTENDABLE GRAPHSPLUMMER MD.1980; DISCRETE MATH.; NLD; DA. 1980; VOL. 31; NO 2; PP. 201-210; BIBL. 11 REF.Article

COLLECTING AUTOGRAPHS: N-NODE GRAPHS THAT HAVE N-INTEGER SIGNATURESBLOOM GS; HELL P; TAYLOR H et al.1979; ANN. NEW YORK ACAD. SCI.; USA; DA. 1979-05; VOL. 319; PP. 93-102; BIBL. 5 REF.Conference Paper

EXPOSITION OF THE CONSTRUCTION OF 103 IRREDUCIBLE GRAPHS FOR THE PROJECTIVE PLANEHAGGARD G.1979; ANN. NEW YORK ACAD. SCI.; USA; DA. 1979; VOL. 328; PP. 105-119; BIBL. 8 REF.Article

REALIZABILITY OF P-POINT GRAPHS WITH PRESCRIBED MINIMUM DEGREE, MAXIMUM DEGREE, AND POINT-CONNECTIVITYBOESCH FT; SUFFEL CL.1981; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1981; VOL. 3; NO 1; PP. 9-18; BIBL. 14 REF.Article

THE CONSTRUCTION OF COSPECTRAL COMPOSITE GRAPHSSCHWENK AJ; HERNDON WC; ELLZEY ML JR et al.1979; ANN. NEW YORK ACAD. SCI.; USA; DA. 1979-05; VOL. 319; PP. 490-496; BIBL. 10 REF.Conference Paper

AMALGAMATION OF GRAPHS AND ITS APPLICATIONSNESETRIL J.1979; ANN. NEW YORK ACAD. SCI.; USA; DA. 1979-05; VOL. 319; PP. 415-428; BIBL. 22 REF.Conference Paper

ON AN EXTREMAL PROBLEM CONCERNING PANCYCLIC GRAPHSSRIDHARAN MR.1978; J. MATH. PHYS. SCI.; IND; DA. 1978; VOL. 12; NO 4; PP. 297-306; BIBL. 7 REF.Article

REDUCTIONS OF THE GRAPH RECONSTRUCTION CONJECTURESTATMAN R.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 36; NO 1; PP. 103-107; BIBL. 2 REF.Article

PUSHOUT-PROPERTIES: AN ANALYSIS OF GLUING CONSTRUCTIONS FOR GRAPHSEHRIG H; KREOWSKI HJ.1979; MATH. NACHR.; DDR; DA. 1979; VOL. 91; PP. 135-149; BIBL. 13 REF.Article

ON MINIMAL AUGMENTATION OF A GRAPH TO OBTAIN AN INTERVAL GRAPHOHTSUKI T; MORI H.1981; J. COMPUT. SYST. SCI.; ISSN 0022-0000; USA; DA. 1981; VOL. 22; NO 1; PP. 60-97; BIBL. 16 REF.Article

SPECTRAL CONDITIONS FOR THE RECONSTRUCTIBILITY OF A GRAPHGODSIL CD; MCKAY BD.1981; J. COMB. THEORY, SER. B; ISSN 0095-8956; USA; DA. 1981; VOL. 30; NO 3; PP. 285-289; BIBL. 4 REF.Article

THE SMALLEST GRAPH OF GIRTH 6 AND VALENCY 7O'KEEFE M; WONG PK.1981; J. GR. THEORY; ISSN 0364-9024; USA; DA. 1981; VOL. 5; NO 1; PP. 79-85; BIBL. 7 REF.Article

G-CONSTRUCTIBILITY OF PLANAR GRAPHSMYNHARDT CM; BROERE I.1980; J. GR. THEORY; ISSN 0364-9024; USA; DA. 1980; VOL. 4; NO 3; PP. 269-278; BIBL. 8 REF.Article

THE EDGE RECONSTRUCTIBILITY OF PLANAR BIDEYREE GRAPHSSWART ER.1980; ANN. DISCRETE MATH.; NLD; DA. 1980; VOL. 9; PP. 7-12; BIBL. 8 REF.Article

COMPLEMENT REDUCIBLE GRAPHSCORNEIL DG; LERCHS H; BURLINGHAM LS et al.1981; DISCRETE APPL. MATH.; ISSN 0166-218X; NLD; DA. 1981; VOL. 3; NO 3; PP. 163-174; BIBL. 26 REF.Article

ON THE CONSTRUCTION OF THE SELF-COMPLEMENTARY GRAPHS ON 12 NODESKROPAR M; READ RC.1979; J. GRAPH. THEORY; USA; DA. 1979; VOL. 3; NO 2; PP. 111-125; BIBL. 9 REF.Article

RECONSTRUCTION OF CRITICAL BLOCKSKRISHNAMOORTHY V; PARTHASARATHY KR.1979; J. MATH. PHYS. SCI.; IND; DA. 1979; VOL. 13; NO 3; PP. 219-239; BIBL. 9 REF.Article

THE CONSTRUCTION OF MINIMAL-LINE GRAPHS WITH GRIVEN AUTOMORPHISM GROUPMCCARTHY DJ; QUINTAS LV.1979; ANN. NEW YORK ACAD. SCI.; USA; DA. 1979; VOL. 328; PP. 144-156; BIBL. 27 REF.Article

CONSTRUCTION OF HAMILTONIAN GRAPHS AND BIGRAPHS WITH PRESCRIBED DEGREES.CHUNGPHAISAN V.1978; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1978; VOL. 24; NO 2; PP. 154-163; BIBL. 11 REF.Article

ON CONSTRUCTION AND IDENTIFICATION OF GRAPHS.WEISFEILER B.1976; LECTURE NOTES MATH.; GERM.; DA. 1976; NO 558; PP. (251P.); BIBL. 6 P. 1/2; ISBN 3540080511Serial Issue

ON THE RECONSTRUCTION CONJECTURE FOR REPARABLE GRAPHSKRISHNAMOORTHY V; PARTHASARATHY KR.1981; J. AUSTR. MATH. SOC., A; AUS; DA. 1981; VOL. 30; NO 3; PP. 307-320; BIBL. 10 REF.Article

F-FACTORS AND RELATED DECOMPOSITIONS OF GRAPHSGRAVER JE; JURKAT WB.1980; J. COMBINATOR. THEORY, B; USA; DA. 1980; VOL. 28; NO 1; PP. 66-84; BIBL. 17 REF.Article

TRANSFORMATIONS WHICH PRESERVE PERFECTNESS AND H-PERFECTNESS OF GRAPHSFONLUPT J; UHRY JP.1980; ; FRA; DA. 1980; IMAG-RR/222; 13 P.; 30 CM; ABS. FRE; BIBL. 5 REF.;[RAPP. RECH.-LAB. INFORM. MATH. APPL. GRENOBLE; VOL. RR-222]Report

ON NONHAMILTONIAN HOMOGENEOUSLY TRACEABLE DIGRAPHSBERMOND JC; SIMOES PEREIRA JMS; ZAMFIRESCU CM et al.1979; MATH. JAP.; JPN; DA. 1979; VOL. 24; NO 4; PP. 423-426; BIBL. 6 REF.Article

  • Page / 20