On local properties of 1-planar graphs with high minimum degree
Work
Year: 2011
Type: article
Abstract: A graph is called 1-planar if there exists its drawing in the plane such that each edge contains at most one crossing. We prove that each 1-planar graph of minimum degree 7 contains a pair of adjacent... more
Source: Ars Mathematica Contemporanea
Authors David E. Hudak, Tomáš Madaras
Institution University of Pavol Jozef Šafárik
Cites: 18
Cited by: 20
Related to: 10
FWCI: 3.32
Citation percentile (by year/subfield): 86.12
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze