Pascal and Francis Bibliographic Databases

Help

Export

Selection :

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

P2p-factorization of a complete bipartite graph

Author
HONG WANG
Univ. Calgary, dep. mathematics statistics, Calgary AB T2N 1N4, Canada
Source

Discrete mathematics. 1993, Vol 120, Num 1-3, pp 307-308 ; ref : 1 ref

CODEN
DSMHA4
ISSN
0012-365X
Scientific domain
Computer science; Mathematics
Publisher
Elsevier, Amsterdam
Publication country
Netherlands
Document type
Article
Language
English
Keyword (fr)
Condition nécessaire suffisante Décomposition graphe Graphe biparti Graphe complet Sous graphe maximal
Keyword (en)
Necessary and sufficient condition Graph decomposition Bipartite graph Complete graph
Keyword (es)
Condición necesaria suficiente Descomposición grafo Grafo bipartido Grafo completo
Classification
Pascal
001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02B Combinatorics. Ordered structures / 001A02B01 Combinatorics / 001A02B01C Graph theory

Discipline
Mathematics
Origin
Inist-CNRS
Database
PASCAL
INIST identifier
4019879

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