A note on the upper bounds on the size of bipartite and tripartite 1-embeddable graphs on surfaces

DOI10.7151/DMGT.2361OpenAlexW3088416118MaRDI QIDQ2107752FDOQ2107752

Hikari Shibuya, Yusuke Suzuki

Publication date: 2 December 2022

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2361

Recommendations

• Upper embeddability of graphs
• scientific article
• On an extremal problem in the class of bipartite 1-planar graphs
• Optimal 1-planar graphs which triangulate other surfaces
• Face size and the maximum genus of a graph. I: Simple graphs

zbMATH Keywords

bipartite graphtripartite graph1-embedding

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Ein Sechsfarbenproblem auf der Kugel
• Ein 7-Farbensatz 1-einbettbarer Graphen auf der projektiven Ebene
• An annotated bibliography on 1-planarity
• An upper bound on the number of edges in an almost planar bipartite graph
• Title not available (Why is that?)
• Cyclic 4-Colorings of Graphs on Surfaces

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: A note on the upper bounds on the size of bipartite and tripartite 1-embeddable graphs on surfaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2107752)