Pascal and Francis Bibliographic Databases

Help

Export

Selection :

Permanent link
http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=20959388

Chromatic equivalence classes of complete tripartite graphs

Author
CHIA, G. L1 ; HO, Chee-Kit2
[1] Institute of Mathematical Sciences, University of Malaya, 50603 Kuala Lumpur, Malaysia
[2] Department of Science & Mathematics, Universiti Tenaga Nasional, 43009 Kajang, Selangor, Malaysia
Source

Discrete mathematics. 2009, Vol 309, Num 1, pp 134-143, 10 p ; ref : 13 ref

CODEN
DSMHA4
ISSN
0012-365X
Scientific domain
Computer science; Mathematics
Publisher
Elsevier, Kidlington
Publication country
United Kingdom
Document type
Article
Language
English
Author keyword
Chromatic polynomials Chromatic uniqueness Complete tripartite graphs
Keyword (fr)
Classe équivalence Condition nécessaire Graphe chromatique Graphe complet Polynôme 68R10
Keyword (en)
Equivalence classes Necessary condition Chromatic graph Complete graph Polynomial
Keyword (es)
Condición necesaria Grafo cromático Grafo completo Polinomio
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A06 Information retrieval. Graph

Discipline
Computer science : theoretical automation and systems
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
20959388

Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS

Access to the document

Searching the Web