• Aucun résultat trouvé

Colouring perfect graphs with bounded clique number

N/A
N/A
Protected

Academic year: 2021

Partager "Colouring perfect graphs with bounded clique number"

Copied!
19
0
0

Texte intégral

Loading

Références

Documents relatifs

In other words, beyond the role of night-time leisure economy in transforming central areas of our cities and, more recently, the range of impacts derived from the touristification

The motivation was a fast realization of the interpolation problem of the Guruswami-Sudan principle, where the block Hankel structure of the set of linear homogeneous equations

Fleischner and Stiebitz [3] proved that in every ( Cycle and triangles' graph there is an odd number of Eulerian orientations. They used this result and the 'Graph polynomial

For finitely generated group that are linear over a field, a polynomial upper bound for these functions is established in [BM], and in the case of higher rank arithmetic groups,

Lemma 4.1. Since the problem is auto-complementary, we consider only the cases of bipartite graphs, line trigraphs and doubled trigraphs. A clique in a bipartite trigraph is an edge,

If its characteristic polynomial has no multiple roots (this occur over the dense open subset of A defined by the non-vanishing of the discriminant of the characteristic polynomial),

Motivated by applications in mathematical imaging, asymptotic expansions of the heat generated by single, or well separated, small particles are derived in [5, 7] based on

In [4], the author defines a new metric, called skew- metric, which is optimal for skew Reed-Solomon codes defined over any division ring (Maximum Skew Distance codes, Theorem 1