Computing Simple Circuits from a Set of Line Segments.
Computing the domination number of grid graphs.
Computing the generating function of a series given its first few terms.
Computing the Metric Dimension of a Graph from Primary Subgraphs
Let G be a connected graph. Given an ordered set W = {w1, . . . , wk} ⊆ V (G) and a vertex u ∈ V (G), the representation of u with respect to W is the ordered k-tuple (d(u, w1), d(u, w2), . . . , d(u, wk)), where d(u, wi) denotes the distance between u and wi. The set W is a metric generator for G if every two different vertices of G have distinct representations. A minimum cardinality metric generator is called a metric basis of G and its cardinality is called the metric dimension of G. It is well...
Computing the molecular expansion of species with the Maple package Devmol.
Computing the period of an Ehrhart quasi-polynomial.
Computing tournament sequence numbers efficiently with matrix techniques.
Comultiplication rules for the double Schur functions and Cauchy identities.
Concave compositions.
Conditional resolvability in graphs: a survey.
Conditions for a totally positive completion in the case of a symmetrically placed cycle.
Conditions for β-perfectness
A β-perfect graph is a simple graph G such that χ(G') = β(G') for every induced subgraph G' of G, where χ(G') is the chromatic number of G', and β(G') is defined as the maximum over all induced subgraphs H of G' of the minimum vertex degree in H plus 1 (i.e., δ(H)+1). The vertices of a β-perfect graph G can be coloured with χ(G) colours in polynomial time (greedily). The main purpose of this paper is to give necessary and sufficient conditions, in terms of forbidden induced subgraphs,...
Conditions nécessaires d’existence des -plans
Les -plans (définis ci-dessous) ont été introduits dans [1]. Leur étude englobe celle des plans affines et projectifs finis, des familles de carrés latins deux à deux orthogonaux, de certains plans équilibrés et partiellement équilibrés . La question de leur existence est très mal connue, celle de leur unicité n’a pratiquement pas été abordée. Nous nous proposons de montrer le théorème suivant : pour qu’il existe un -plan il est nécessaire que : soient entiers.
Conditions on periodicity for sum-free sets.
Configuration of mutually perspective triangles
Configuration spaces of weighted graphs in high dimensional Euclidean spaces.
Configurations of rank- extremal even unimodular lattices ()
We show that if is an extremal even unimodular lattice of rank with , then is generated by its vectors of norms and . Our result is an extension of Ozeki’s result for the case .
Confluent drawings: visualizing non-planar diagrams in a planar way.
Congestion optimale du plongement de l’hypercube dans la chaîne
Congruence classes of orientable 2-cell embeddings of bouquets of circles and dipoles.