Completely 0-simple semigroups and their associated graphs and groups.
Completely Independent Spanning Trees in (Partial) k-Trees
Two spanning trees T1 and T2 of a graph G are completely independent if, for any two vertices u and v, the paths from u to v in T1 and T2 are internally disjoint. For a graph G, we denote the maximum number of pairwise completely independent spanning trees by cist(G). In this paper, we consider cist(G) when G is a partial k-tree. First we show that [k/2] ≤ cist(G) ≤ k − 1 for any k-tree G. Then we show that for any p ∈ {[k/2], . . . , k − 1}, there exist infinitely many k-trees G such that cist(G)...
Complétude en théorie sur graphes orientés
Complexes of Directed Trees of Complete Multipartite Graphs
Complexité de l'arboricité linéaire d'un graphe
Complexité de l'arboricité linéaire d'un graphe II
Complexité de problèmes liés aux graphes sans circuit
Complexity aspects of the Helly property: graphs and hypergraphs.
Complexity of decomposing graphs into factors with given diameters or radii
Component evolution in random intersection graphs.
Comportement asymptotique des fonctions harmoniques sur les arbres
Composantes préconservatives minimales d'un réseau de Petri : étude structurelle
Composition and structure of social networks
Social networks representing one or more relationships between individuals and one or more categorical characteristics of the individuals exhibit both structure and composition. Probabilistic models of such networks can be used for analyzing the interrelations between structural and compositional variables, for instance in order to find how structure can be explained by composition or how structure explains composition. Different models are discussed and different statistical methods are employed...
Compositional models, Bayesian models and recursive factorization models
Compositional models are used to construct probability distributions from lower-order probability distributions. On the other hand, Bayesian models are used to represent probability distributions that factorize according to acyclic digraphs. We introduce a class of models, called recursive factorization models, to represent probability distributions that recursively factorize according to sequences of sets of variables, and prove that they have the same representation power as both compositional...
Compositions of graphs revisited.
Compositions of maps and hypermaps. (Compositions des cartes et hypercartes.)
Computation of the vertex Folkman numbers and .
Computational comparison of two methods for finding the shortest complete cycle or circuit in a graph
Computing and drawing isomorphic subgraphs.
Computing Simple Circuits from a Set of Line Segments.