Pascal and Francis Bibliographic Databases

Help

Export

Selection :

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

A sufficient condition for a planar graph to be 3-choosable

Author
LIANG SHEN1 ; YINGQIAN WANG1
[1] College of Mathematics, Physics and Information Engineering, Zhejiang Normal University, Jinhua 321004, China
Source

Information processing letters. 2007, Vol 104, Num 4, pp 146-151, 6 p ; ref : 9 ref

CODEN
IFPLAT
ISSN
0020-0190
Scientific domain
Computer science
Publisher
Elsevier Science, Amsterdam
Publication country
Netherlands
Document type
Article
Language
English
Author keyword
Choosability Combinatorial problems Cycle Planar graph
Keyword (fr)
Analyse algorithme Condition suffisante Cycle graphe Graphe planaire Informatique théorique Problème combinatoire Traitement information 68R10
Keyword (en)
Algorithm analysis Sufficient condition Cycle(graph) Planar graph Computer theory Combinatorial problem Information processing
Keyword (es)
Análisis algoritmo Condición suficiente Ciclo diagrama Grafo planario Informática teórica Problema combinatorio Procesamiento información
Classification
Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A05 Algorithmics. Computability. Computer arithmetics

Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A06 Information retrieval. Graph

Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A08 Miscellaneous

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

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