On properties of maximal 1-planar graphs | Zendy

David E. Hudak | Zendy; Tomáš Madaras | Zendy; Yusuke Suzuki | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

On properties of maximal 1-planar graphs

Author(s) -

David E. Hudak,

Tomáš Madaras,

Yusuke Suzuki

Publication year - 2012

Publication title -

discussiones mathematicae graph theory

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.476

H-Index - 19

eISSN - 2083-5892

pISSN - 1234-3099

DOI - 10.7151/dmgt.1639

Subject(s) - mathematics , combinatorics , planar graph , planar , discrete mathematics , graph , computer science , computer graphics (images)

Department of Mathematics, Faculty of ScienceNiigata University8050, Ikarashi 2-no-cho, Nishi-ku, Niigata, 950-2181, Japane-mail: y-suzuki@math.sc.niigata-u.ac.jpAbstractA graph is called 1-planar if there exists a drawing in the plane so thateach edge contains at most one crossing. We study maximal 1-planar graphsfrom the point of view of properties of their diagrams, local structure andhamiltonicity.Keywords: 1-planar graph, maximal graph.2010 Mathematics Subject Classication: 05C10.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research