Pascal and Francis Bibliographic Databases

Help

Export

Selection :

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

A note on the strong chromatic index of bipartite graphs

Author
NAKPRASIT, K1
[1] Khon Kaen University, Khon Kaen 40002, Thailand
Source

Discrete mathematics. 2008, Vol 308, Num 16, pp 3726-3728, 3 p ; ref : 10 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
Induced matching Strong edge-coloring
Keyword (fr)
Combinatoire Couleur Graphe biparti Graphe chromatique Mathématiques discrètes Maximum Nombre entier Indice chromatique
Keyword (en)
Combinatorics Color Bipartite graph Chromatic graph Discrete mathematics Maximum Integer
Keyword (es)
Combinatoria Color Grafo bipartido Grafo cromático Matemáticas discretas Máximo Entero
Classification
Pascal
001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02B Combinatorics. Ordered structures / 001A02B01 Combinatorics

Pascal
001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02C Algebra

Discipline
Mathematics
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
20392526

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