Pascal and Francis Bibliographic Databases

Help

Export

Selection :

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

A sufficient condition for the bicolorability of a hypergraph

Author
DEFOSSEZ, David1
[1] Laboratoire Leibniz-Imag, 46 avenue Félix Viallet, 38031 Grenoble, France
Source

Discrete mathematics. 2008, Vol 308, Num 11, pp 2265-2268, 4 p ; ref : 7 ref

CODEN
DSMHA4
ISSN
0012-365X
Scientific domain
Computer science; Mathematics
Publisher
Elsevier, Amsterdam
Publication country
Netherlands
Document type
Article
Language
English
Author keyword
Bicolorable hypergraphs Odd hypercycles Sterboul conjecture
Keyword (fr)
Combinatoire Condition suffisante Cycle Hypergraphe 05C65 05XX 68R05 Graphe Berge Graphe parfait Hypercycle
Keyword (en)
Combinatorics Sufficient condition Cycle Hypergraph Hypercycle
Keyword (es)
Combinatoria Condición suficiente Ciclo Hipergráfico
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

Pascal
001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A05 Algorithmics. Computability. Computer arithmetics

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

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