Back to Results
First PageMeta Content
Inequalities / Minor / Cubic graph / Neighbourhood / Planar graph / Graph / Path decomposition / Petersen graph / Graph theory / Topological graph theory / Crossing number


Crossing Number is Hard for Cubic Graphs? Petr Hlinˇ en´ y Department of Computer Science ˇ – Technical University of Ostrava,
Add to Reading List

Document Date: 2005-02-11 15:57:54

Open Document

File Size: 295,40 KB

Share Result on Facebook

Country

Jordan / Czech Republic / /

/

Facility

Charles University / Technical University of Ostrava / /

IndustryTerm

important applications / /

OperatingSystem

Xp / /

Organization

Department of Computer Science / Ministry of Education / University of Ostrava / Charles University / Institute for Theoretical Computer Science / /

Person

Petr Hlin / /

Product

M-16 / /

PublishedMedium

Theoretical Computer Science / /

Technology

above mentioned FPT algorithm / /

SocialTag