Skip to main navigation
Skip to search
Skip to main content

University of Copenhagen Research Portal Home

Help & FAQ
- Dansk
- English

Home
Profiles
Research output
Research units
Press/Media
Activities
Prizes
???studenttheses???
Datasets

Search by expertise, name or affiliation

Coloring 3-colorable graphs with less than n^1/5 colors

Ken-ichi Kawarabayashi, Mikkel Thorup

Department of Computer Science

8 Citations (Scopus)

Overview
Fingerprint

Fingerprint

Dive into the research topics of 'Coloring 3-colorable graphs with less than n^1/5 colors'. Together they form a unique fingerprint.

Sort by
Weight
Alphabetically

Keyphrases

Mathematics

Powered by Pure, Scopus & Elsevier Fingerprint Engine™

All content on this site: Copyright © 2024 University of Copenhagen Research Portal, its licensors, and contributors. All rights are reserved, including those for text and data mining, AI training, and similar technologies. For all open access content, the relevant licensing terms apply

We use cookies to help provide and enhance our service and tailor content. By continuing you agree to the use of cookies

University of Copenhagen Research Portal data protection policy

About web accessibility

Report vulnerability