Nearly light cycles in embedded graphs and crossing-critical graphs Article

•  
• Overview
•  
• Research
•  
• Identity
•  
• Additional Document Info
•  
• View All
•  

Overview

abstract

• We find a lower bound for the proportion of face boundaries of an embedded graph that are nearly light (that is, they have bounded length and at most one vertex of large degree). As an application, we show that every sufficiently large k-crossing-critical graph has crossing number at mOSt 2k %2b 23. © 2006 Wiley Periodicals, Inc.

authors

• Lomelí M.
• Salazar Anaya Gelasio

publication date

• 2006-01-01

published in

• Journal of Graph Theory  Journal

Research

keywords

• Crossing number; Crossing-critical; Graph embedding; Light; Nearly light Boundary conditions; Number theory; Numerical methods; Crossing numbers; Crossing-critical graphs; Graph embedding; Nearly light; Graph theory

Identity

Digital Object Identifier (DOI)

• 10.1002/jgt.20172

Additional Document Info

start page

• 151

end page

• 156

volume

• 53

issue

• 2