Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("GRAPHE COMPLET")

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 1794

  • Page / 72

Export

Selection :

  • and

SOME SIMPLIFIED NP-COMPLETE GRAPH PROBLEMS.GAREY MR; JOHNSON DS.1976; THEOR. COMPUTER SCI.; NETHERL.; DA. 1976; VOL. 1; NO 3; PP. 237-267; BIBL. 19 REF.Article

COLORING THE EDGES OF A COMPLETE GRAPHVARGA AG.1972; MATH. NACHR.; DTSCH.; DA. 1972; VOL. 52; NO 1-6; PP. 231-246Serial Issue

EDGES WITHOUT CROSSINGS IN DRAWINGS OF COMPLETE GRAPHS.HARBORTH H; MENGERSEN I.1974; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1974; VOL. 17; NO 3; PP. 299-311; BIBL. 4 REF.Article

ON THE NUMBER OF 1-FACTORIZATION OF THE COMPLETE GRAPH.LINDNER CC; MENDELSOHN E; ROSA A et al.1976; J. COMBINATOR THEORY, B; U.S.A.; DA. 1976; VOL. 20; NO 3; PP. 265-282; BIBL. 20 REF.Article

ON THE DECOMPOSITION OF KN INTO COMPLETE BIPARTITE GRAPHSTVERBERG H.1982; J. GR. THEORY; ISSN 0364-9024; USA; DA. 1982; VOL. 6; NO 4; PP. 493-494; BIBL. 2 REF.Article

DECOMPOSITIONS OF COMPLETE GRAPHS INTO SUBGRAPHS ISOMORPHIC TO A GIVEN GRAPH.WILSON RM.1976; IN: BR. COMB. CONF. 5. PROC.; ABERDEEN; 1975; WINNIPEG; UTILITAS MATHEMATICA; DA. 1976; PP. 647-659; BIBL. 9 REF.Conference Paper

A GROUP-DIVISIBLE DESIGN GD(4,1,2; N) EXISTS IFF N=2 (MOD 6), N NON=8 (OR: THE PACKING OF COCKTAIL PARTY GRAPHS WITH K4'S).BROUWER AE; SCHRIJVER A.1976; STICHTG MATH. CENTRUM, AFD. ZUIVERE WISKDE; NEDERL.; DA. 1976; NO 64; PP. 1-9; BIBL. 10 REF.Serial Issue

FACTORIZING THE COMPLETE GRAPH INTO FACTORS WITH LARGE STAR NUMBER.ERDOS P; SAUER N; SCHAER J et al.1975; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1975; VOL. 18; NO 2; PP. 180-183; BIBL. 6 REF.Article

THE GENUS OF KN-K2.JUNGERMAN M.1975; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1975; VOL. 18; NO 1; PP. 53-58; BIBL. 3 REF.Article

GRAPHE REPRESENTATIF DE L'HYPERGRAPHE H-PARTI COMPLET.BERMOND JC.1974; LECTURE NOTES MATH.; GER.; DA. 1974; NO 411; PP. 34-53; BIBL. 16 REF.; (HYPERGR. SEMIN.; COLUMBUS, OHIO; 1972)Conference Paper

AN APPLICATION OF THE SOLUTION OF KIRKMAN'S SCHOOLGIRL PROBLEM: THE DECOMPOSITION OF THE SYMMETRIC ORIENTED COMPLETE GRAPH INTO 3-CIRCUITS.BERMOND JC.1974; DISCRETE MATH.; NETHERL.; DA. 1974; VOL. 8; NO 4; PP. 301-304; BIBL. 2 REF.Article

GENERALIZED RAMSEY THEORY FOR GRAPHS. I. DIAGONAL NUMBERSCHVATAL V; HARARY F.1973; PERIOD. MATH. HUNGAR.; HONGR.; DA. 1973; VOL. 3; NO 1-2; PP. 115-124; BIBL. 18 REF.Serial Issue

ON P-QUASIGROUPS AND DECOMPOSITIONS OF COMPLETE UNDIRECTED GRAPHSDENES J; KEEDWELL AD.1972; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1972; VOL. 13; NO 3; PP. 270-275; BIBL. 4 REF.Serial Issue

HINREICHENDE BEDINGUNGEN FUER DIE EXISTENZ VON TEILGRAPHEN, DIE ZU EINEM VOLLSTAENDIGEN GRAPHEN HOMOEOMORPH SIND = CONDITIONS SUFFISANTES D'EXISTENCE DE GRAPHES PARTIELS HOMOMORPHES A DES GRAPHES COMPLETSWOLFGANG M.1972; MATH. NACHR.; DTSCH.; DA. 1972; VOL. 53; NO 1-6; PP. 145-159; BIBL. 10 REF.Serial Issue

SCHUR CONVEX FUNCTIONS ON THE SPECTRA OF GRAPHSCONSTANTINE GM.1983; DISCRETE MATHEMATICS; ISSN 0012-365X; NLD; DA. 1983; VOL. 45; NO 2-3; PP. 181-188; BIBL. 8 REF.Article

ALTERNATING EULERIAN TRAILS WITH PRESCRIBED DEGREES IN TWO EDGE-COLORED COMPLETE GRAPHSDAS P; RAO SB.1983; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1983; VOL. 43; NO 1; PP. 9-20; BIBL. 9 REF.Article

AN ASSOCIATION SCHEME FOR THE 1-FACTORS OF THE COMPLETE GRAPHRANDS BMI.1983; JOURNAL OF COMBINATORIAL THEORY. SERIES A.; ISSN 0097-3165; USA; DA. 1983; VOL. 34; NO 3; PP. 301-312; BIBL. 6 REF.Article

CYCLE DECOMPOSITION OF COMPLETE GRAPHSFARRELL EJ.1982; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1982; VOL. 38; NO 2-3; PP. 157-162; BIBL. 3 REF.Article

DECOMPOSITION OF A COMPLETE GRAPH INTO TRAILS OF GIVEN LENGTHSBOUCHET A; LOPEZ BRACHO R.1982; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1982; VOL. 42; NO 2-3; PP. 145-152; BIBL. 5 REF.Article

BINDING NUMBER, CYCLES AND COMPLETE GRAPHSKANE VG; MOHANTY SP.1981; LECT. NOTES MATH.; ISSN 0075-8434; DEU; DA. 1981; NO 885; PP. 290-296; BIBL. 7 REF.Conference Paper

UNA CARATTERIZZAZIONE DEI GRAFI TOTALI DI BIB DISEGNI = UNE CARACTERISATION DES GRAPHES COMPLETS DE CONFIGURATION BIBSCOTTI F.1980; RENDICONTI - ISTITUTO LOMBARDO. A. SCIENZE MATEMATICHE E APPLICAZIONI; ISSN 512753; ITA; DA. 1980 PUBL. 1982; VOL. 114; PP. 125-131; BIBL. 7 REF.Article

INFINITE FAMILIES OF BIEMBEDDING NUMBERSANDERSON I.1979; J. GRAPH THEORY; USA; DA. 1979; VOL. 3; NO 3; PP. 263-268; BIBL. 7 REF.Article

ON AMALGAMATION OF GRAPHS AND ESSENTIAL SETS OF GENERATORS.POLJAK S; TURZIK D.1978; COMMENT. MATH. UNIV. CAROLINAE; CESKOSL.; DA. 1978; VOL. 19; NO 2; PP. 359-369; BIBL. 2 REF.Article

SYMMETRY GROUPS OF SOME PERFECT 1-FACTORIZATIONS OF COMPLETE GRAPHS.ANDERSON BA.1977; DISCRETE MATH.; NETHERL.; DA. 1977; VOL. 18; NO 3; PP. 227-234; BIBL. 12 REF.Article

GRAPHS WITH CYCLES HAVING ADJACENT LINES DIFFERENT COLORS.DAYKIN DE.1976; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1976; VOL. 20; NO 2; PP. 149-152; BIBL. 2 REF.Article

  • Page / 72