Brève communication. Une caractérisation des graphes chromatiques minimaux sans sommet isolé
Brève communication. Une nouvelle méthode de marquage dans la recherche d'une chaîne de longueur maximale d'un arbre
Bridge and cycle degrees of vertices of graphs.
Bridges and Hamiltonian circuits in planar graphs.
Broken Circuits in Matroids-Dohmen’s Inductive Proof
Dohmen [4] gives a simple inductive proof of Whitney’s famous broken circuits theorem. We generalise his inductive proof to the case of matroids
Broken-cycle-free subgraphs and the log-concavity conjecture for chromatic polynomials.
Building graphs from colored trees.
-saturated graphs of minimum size
-groups.
Cacti, braids and complex polynomials.
Calcul du centralisateur d'un groupe de permutations
Calcul pratique du treillis de Galois d'une correspondance
Calculating the number of the linear factors in planar graphs.
Calculation of Rozansky-Witten invariants on the Hilbert schemes of points on a K3 surface and the generalised kummer varieties.
Can Visibility Graphs Be Represented Compactly?.
Cancellation of direct products of digraphs
We investigate expressions of form A×C ≅ B×C involving direct products of digraphs. Lovász gave exact conditions on C for which it necessarily follows that A ≅ B. We are here concerned with a different aspect of cancellation. We describe exact conditions on A for which it necessarily follows that A ≅ B. In the process, we do the following: Given an arbitrary digraph A and a digraph C that admits a homomorphism onto an arc, we classify all digraphs B for which A×C ≅ B×C.
Canonical characters on simple graphs
A multiplicative functional on a graded connected Hopf algebra is called the character. Every character decomposes uniquely as a product of an even character and an odd character. We apply the character theory of combinatorial Hopf algebras to the Hopf algebra of simple graphs. We derive explicit formulas for the canonical characters on simple graphs in terms of coefficients of the chromatic symmetric function of a graph and of canonical characters on quasi-symmetric functions. These formulas and...
Canonical decomposition of outerplanar maps and application to enumeration, coding and generation.
Canonical equivalence relations for parameter sets
Canonical ordering theorems, a first attempt