Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Nombre chromatique")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 601

  • Page / 25
Export

Selection :

  • and

Some star extremal circulant graphsWENSONG LIN.Discrete mathematics. 2003, Vol 271, Num 1-3, pp 169-177, issn 0012-365X, 9 p.Article

RELATIVE COLORINGS OF GRAPHSKAINEN PC.1973; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1973; VOL. 14; NO 3; PP. 259-262; BIBL. 4 REF.Serial Issue

COMPLEMENTARY GRAPHS AND TOTAL CHROMATIC NUMBERS.COOK RJ.1974; S.I.A.M. J. APPL. MATH.; U.S.A.; DA. 1974; VOL. 27; NO 4; PP. 626-628; BIBL. 9 REF.Article

The harmonious chromatic number of a complete binary and trinary treeZHIKANG LU.Discrete mathematics. 1993, Vol 118, Num 1-3, pp 165-172, issn 0012-365XArticle

Tight relation between the circular chromatic number and the girth of series-parallel graphsZHISHI PAN; XUDING ZHU.Discrete mathematics. 2002, Vol 254, Num 1-3, pp 393-404, issn 0012-365XArticle

New approximation guarantee for chromatic numberARORA, Sanjeev; CHLAMTAC, Eden; CHARIKAR, Moses et al.Annual ACM symposium on theory of computing. 2006, pp 215-224, isbn 1-59593-134-1, 1Vol, 10 p.Conference Paper

The chromatic number of the product of two χ1-chromatic graphs can be countableHAJNAL, A.Combinatorica (Print). 1985, Vol 5, Num 2, pp 137-139, issn 0209-9683Article

What must and what need not be contained in a graph of uncountable chromatic number?HAJNAL, A; KOMJATH, P.Combinatorica (Print). 1984, Vol 4, Num 1, pp 47-52, issn 0209-9683Article

The chromatic number of the product of two 4-chromatic graphs is 4EL-ZAHAR, M; SAUER, N. W.Combinatorica (Print). 1985, Vol 5, Num 2, pp 121-126, issn 0209-9683Article

Hall ratio of the Mycielski graphsCROPPER, Mathew; GYARFAS, Andras; LEHEL, Jenö et al.Discrete mathematics. 2006, Vol 306, Num 16, pp 1988-1990, issn 0012-365X, 3 p.Article

Circular chromatic number for iterated Mycielski graphsDER-FEN LIU, Daphne.Discrete mathematics. 2004, Vol 285, Num 1-3, pp 335-340, issn 0012-365X, 6 p.Article

ON PROPERTY BR.JOHNSON DS.1976; J. COMBINATOR. THEORY, B; U.S.A.; DA. 1976; VOL. 20; NO 1; PP. 64-66; BIBL. 3 REF.Article

NOMBRE CHROMATIQUE TOTAL DU JOINT D'UN ENSEMBLE STABLE PAR UN CYCLE.MEYER JC.1976; DISCRETE MATH.; NETHERL.; DA. 1976; VOL. 15; NO 1; PP. 41-54; ABS. ANGL.; BIBL. 4 REF.Article

On the chromatic number of rational five-spaceCHILAKAMARRI, K. B.Aequationes mathematicae (Printed ed.). 1990, Vol 39, Num 2-3, pp 146-148, issn 0001-9054, 3 p.Article

Total chromatic numbersSEOUD, M. A.Applied mathematics letters. 1992, Vol 5, Num 6, pp 37-39, issn 0893-9659Article

A note on the matching numbers of triangle-free graphsFRUCHT, R. W; GIUDICI, R. E.Journal of graph theory. 1985, Vol 9, Num 4, pp 455-458, issn 0364-9024Article

On the chromatic number of multiple interval graphs and overlap graphsGYARFAS, A.Discrete mathematics. 1985, Vol 55, Num 2, pp 161-166, issn 0012-365XArticle

A note on the sharp concentration of the chromatic number of random graphsŁUCZAK, T.Combinatorica (Print). 1991, Vol 11, Num 3, pp 295-297, issn 0209-9683Article

The chromatic number of graphs wich induce neither K1,3 NORK5-eKIERSTEAD, H. A; SCHMERL, J. H.Discrete mathematics. 1986, Vol 58, Num 3, pp 253-262, issn 0012-365XArticle

On the chromatic number of the product of graphsDUFFUS, D; SANDS, B; WOODROW, R. E et al.Journal of graph theory. 1985, Vol 9, Num 4, pp 487-495, issn 0364-9024Article

Chromatic number of classes of matrices of zeros and onesBRUALDI, R. A; MANBER, R.Discrete mathematics. 1984, Vol 50, Num 2-3, pp 143-152, issn 0012-365XArticle

Measurable chromatic number of geometric graphs and sets without some distances in euclidean spaceSZEKELY, L. A.Combinatorica (Print). 1984, Vol 4, Num 2-3, pp 213-218, issn 0209-9683Article

Solutions to Edmond's and Katona's problems on families of separating subsetsCAI MAO-CHENG.Discrete mathematics. 1983, Vol 47, Num 1, pp 13-21, issn 0012-365XArticle

ON GRAPHS CRITICAL WITH RESPECT TO EDGE-COLOURINGSHIAN POH YAP.1981; DISCRETE MATH.; ISSN 0012-365X; NLD; DA. 1981; VOL. 37; NO 2-3; PP. 289-296; BIBL. 11 REF.Article

ON THE CHROMATIC NUMBER OF SKEW GRAPHSPAHLINGS H.1978; J. COMBINATOR. THEORY, B; USA; DA. 1978; VOL. 25; NO 3; PP. 303-306; BIBL. 6 REF.Article

  • Page / 25