Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("05C15")

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

Author Country

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

Results 1 to 25 of 441

  • Page / 18
Export

Selection :

  • and

THOMASSEN'S CHOOSABILITY ARGUMENT REVISITEDWOOD, David R; LINUSSON, Svante.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 4, pp 1632-1637, issn 0895-4801, 6 p.Article

TURAN GRAPHS AND THE NUMBER OF COLORINGSNORINE, Serguei.SIAM journal on discrete mathematics (Print). 2011, Vol 25, Num 1-2, pp 260-266, issn 0895-4801, 7 p.Article

On the adjacent vertex distinguishing total coloring numbers of graphs with A = 3XIANG'EN CHEN.Discrete mathematics. 2008, Vol 308, Num 17, pp 4003-4007, issn 0012-365X, 5 p.Article

HEREDITARY DISCREPANCIES IN DIFFERENT NUMBERS OF COLORS IIDOERR, Benjamin; FOUZ, Mahmoud.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 3, pp 1205-1213, issn 0895-4801, 9 p.Article

Minimum chromaticity of circulant graphsOBRADOVIC, Nenad; PETERS, Joseph; RUZIC, Goran et al.Discrete mathematics. 2005, Vol 299, Num 1-3, pp 288-296, issn 0012-365X, 9 p.Article

A NEW PROOF OF THE H-COLORING DICHOTOMYSIGGERS, Mark H.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 4, pp 2204-2210, issn 0895-4801, 7 p.Article

Cost colourings of hypergraphsDRGAS-BURCHARDT, Ewa; FIEDOROWICZ, Anna.Discrete mathematics. 2007, Vol 307, Num 11-12, pp 1298-1305, issn 0012-365X, 8 p.Conference Paper

ON ZERO-FREE INTERVALS IN (1,2) OF CHROMATIC POLYNOMIALS OF SOME FAMILIES OF GRAPHSDONG, F. M; KOH, K. M.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 2, pp 370-378, issn 0895-4801, 9 p.Article

Size of weakly saturated graphsSIDOROWICZ, E.Discrete mathematics. 2007, Vol 307, Num 11-12, pp 1486-1492, issn 0012-365X, 7 p.Conference Paper

On 2-factorizations whose automorphism group acts doubly transitively on the factorsMAZZUOCCOLO, Giuseppe.Discrete mathematics. 2008, Vol 308, Num 5-6, pp 931-939, issn 0012-365X, 9 p.Conference Paper

Generalised game colouring of graphsBOROWIECKI, Mieczyslaw; SIDOROWICZ, Elzbieta.Discrete mathematics. 2007, Vol 307, Num 11-12, pp 1225-1231, issn 0012-365X, 7 p.Conference Paper

Equitable coloring planar graphs with large girthJIANLIANG WU; PING WANG.Discrete mathematics. 2008, Vol 308, Num 5-6, pp 985-990, issn 0012-365X, 6 p.Conference Paper

ACYCLIC EDGE-COLORING OF PLANAR GRAPHSBASAVARAJU, Man; SUNIL CHANDRAN, L; COHEN, Nathann et al.SIAM journal on discrete mathematics (Print). 2011, Vol 25, Num 1-2, pp 463-478, issn 0895-4801, 16 p.Article

EVERY PLANE GRAPH OF MAXIMUM DEGREE 8 HAS AN EDGE-FACE 9-COLORINGKANG, Ross J; SERENI, Jean-Sebastien; STEHLIK, Matéj et al.SIAM journal on discrete mathematics (Print). 2011, Vol 25, Num 1-2, pp 514-533, issn 0895-4801, 20 p.Article

MULTIPLE COLORING OF CONE GRAPHSZHISHI PAN; XUDING ZHU.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 4, pp 1515-1526, issn 0895-4801, 12 p.Article

EQUITABLE COLORING OF SPARSE PLANAR GRAPHSRONG LUO; SERENI, Jean-Sébastien; STEPHENS, D. Christopher et al.SIAM journal on discrete mathematics (Print). 2011, Vol 24, Num 4, pp 1572-1583, issn 0895-4801, 12 p.Article

BACKBONE COLORINGS AND GENERALIZED MYCIELSKI GRAPHSMISKUF, Jozef; SKREKOVSKI, Riste; TANCER, Martin et al.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 2, pp 1063-1070, issn 0895-4801, 8 p.Article

ON (3, 1)*-COLORING OF PLANE GRAPHSBAOGANG XU.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 1, pp 205-220, issn 0895-4801, 16 p.Article

ADAPTED LIST COLORING OF GRAPHS AND HYPERGRAPHSKOSTOCHKA, A. V; XUDING ZHU.SIAM journal on discrete mathematics (Print). 2009, Vol 22, Num 1, pp 398-408, issn 0895-4801, 11 p.Article

Heterochromatic tree partition numbers for complete bipartite graphsHE CHEN; ZEMIN JIN; XUELIANG LI et al.Discrete mathematics. 2008, Vol 308, Num 17, pp 3871-3878, issn 0012-365X, 8 p.Article

Lower bounds for the game colouring number of partial k-trees and planar graphsJIAOJIAO WU; XUDING ZHU.Discrete mathematics. 2008, Vol 308, Num 12, pp 2637-2642, issn 0012-365X, 6 p.Article

On the hardness of 4-coloring a 3-colorable graphGURUSWAMI, Venkatesan; KHANNA, Sanjeev.SIAM journal on discrete mathematics (Print). 2005, Vol 18, Num 1, pp 30-40, issn 0895-4801, 11 p.Article

FIRST-FIT ALGORITHM FOR THE ON-LINE CHAIN PARTITIONING PROBLEMBOSEK, Bartlomiej; KRAWCZYK, Tomasz; SZCZYPKA, Edward et al.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 4, pp 1992-1999, issn 0895-4801, 8 p.Article

THE TWO-COLORING NUMBER AND DEGENERATE COLORINGS OF PLANAR GRAPHSKIERSTEAD, Hal; MOHAR, Bojan; SPACAPAN, Simon et al.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 3, pp 1548-1560, issn 0895-4801, 13 p.Article

THE LOCAL NATURE OF LIST COLORINGS FOR GRAPHS OF HIGH GIRTHCHIERICHETTI, Flavio; VATTANI, Andrea.SIAM journal on computing (Print). 2010, Vol 39, Num 6, pp 2232-2250, issn 0097-5397, 19 p.Article

  • Page / 18