z-logo
open-access-imgOpen Access
A note on the upper bounds on the size of bipartite and tripartite 1-embeddable graphs on surfaces
Author(s) -
Shibuya Hikari,
Yusuke Suzuki
Publication year - 2020
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.2361
Subject(s) - mathematics , combinatorics , bipartite graph , upper and lower bounds , discrete mathematics , graph , mathematical analysis
In this note, we show sharp upper bounds of the size of simple bipartite and tripartite 1-embeddable graphs on closed surfaces.

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

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom