RECORD DETAIL

Back To Previous

UPA Perpustakaan Universitas Jember

New Construction of Graphs with High Chromatic Number and Small Clique Number

No image available for this title
We introduce a new method for constructing graphs with high chromatic number and small clique number. Indeed, we present a new proof for the well-known Kneser conjecture via this method.

Availability
EB00000003676KAvailable
Detail Information

Series Title

-

Call Number

-

Publisher

: ,

Collation

-

Language

ISBN/ISSN

-

Classification

NONE

Detail Information

Content Type

E-Jurnal

Media Type

-

Carrier Type

-

Edition

-

Specific Detail Info

-

Statement of Responsibility

No other version available
File Attachment