ETUDE THEORIQUE DU NOYAU D'UN GRAPHEJACOB HENRI.1979; ; FRA; DA. 1979; 98 P.: ILL.; 30 CM; BIBL. 38 REF.; TH. 3E CYCLE: MATH., THEOR. GRAPHES/PARIS 6/1979Thesis

UNE BORNE SUPERIEURS POUR LA FAIBLESSE MINIMUM D'UN QUASI-NOYAU DANS UN GRAPHEVINCKE P.1978; PROBLEMES COMBINATOIRES ET THEORIE DES GRAPHES. CENTRE NATIONAL DE LA RECHERCHE SCIENTIFIQUE. COLLOQUE INTERNATIONAL. 260/1976/ORSAY; FRA; PARIS: CNRS; DA. 1978; PP. 415-416; ABS. ENG; BIBL. 5 REF.Conference Paper

UBER DIE BESTIMMUNG VON KERNEN IN ENDLICHEN GRAPHEN = SUR LA DETERMINATION DES NOYAUX DANS LES GRAPHES FINISTINHOFER G.1972; COMPUTING; AUSTR.; DA. 1972; VOL. 9; NO 2; PP. 139-147; ABS. ANGL.; BIBL. 10 REF.Serial Issue

SOME REMARKS CONCERNING THE KERNELS OF A STRONG CONNECTED DIGRAPHMARCU D.1980; AN. STIINT. UNIV. "AL. I. CUZA" IASI, SECT. 1A; ISSN 0041-9109; ROM; DA. 1980; VOL. 26; NO 2; PP. 417-418; BIBL. 4 REF.Article

SOLUTIONS AND KERNELS OF A DIRECTED GRAPHHARMINC M.1982; MATH. SLOV.; ISSN 0139-9918; CSK; DA. 1982; VOL. 32; NO 3; PP. 263-267; ABS. RUS; BIBL. 8 REF.Article

A NOTE ON KERNEL-CRITICAL GRAPHSDUCHET P; MEYNIEL H.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 33; NO 1; PP. 103-105; BIBL. 2 REF.Article

THE K-NUCLEUS OF A GRAPHSLATER PJ.1981; NETWORKS; ISSN 0028-3045; USA; DA. 1981; VOL. 11; NO 3; PP. 233-242; BIBL. 22 REF.Article

REPRESENTATIONS, NOYAUX EN THEORIE DES GRAPHES ET HYPERGRAPHESDUCHET PIERRE.1979; ; FRA; DA. 1979; 208 P.; 21 CM; BIBL. DISSEM.; TH.: SCI. MATH./PARIS 6/1979Thesis

On kernels and semikernels of digraphsGALEANA-SANCHEZ, H; NEUMANN-LARA, V.Discrete mathematics. 1984, Vol 48, Num 1, pp 67-76, issn 0012-365XArticle

Contribution à l'étude des noyaux dans les graphes = Study of kernels in graphsBLIDIA, Mostafa.1984, 67 fThesis

Contributions à l'étude de quelques problèmes en théorie des graphes (circuits hamiltoniens, coloration, noyaux) = Contributions to the study of some problems of graph theory (Hamiltonian circuits, coloring, keinels)MEYNIEL, Henry.1982, 116 pThesis

Recent problems and results about kernels in directed graphsBERGE, C; DUCHET, P.Discrete mathematics. 1990, Vol 86, Num 1-3, pp 27-31, issn 0012-365X, 5 p.Article

Une étude structurelle des graphes parfaits = A structural study of perfect graphsMaffray, Frédéric; Duchet, Pierre.1992, 177 p.Thesis

Graph kernels and Gaussian processes for relational reinforcement learningDRIESSENS, Kurt; RAMON, Jan; GÄRTNER, Thomas et al.Machine learning. 2006, Vol 64, Num 1-3, pp 91-119, issn 0885-6125, 29 p.Conference Paper

The chromatic index of a graph whose core has maximum degree twoHILTON, A. J. W; ZHAO CHENG.Discrete mathematics. 1992, Vol 101, Num 1-3, pp 135-147, issn 0012-365XArticle