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

DOI10.7151/DMGT.2361MaRDI QIDQ2107752zbMATH OpenOpenAlexFDO

Authors Hikari Shibuya, Yusuke Suzuki

Publication date 2 December 2022

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

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

zbMATH Keywords

bipartite graphtripartite graph1-embedding

Mathematics Subject Classification ID

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

Recommendations

• Upper embeddability of graphs
• scientific article; zbMATH DE number 4156462
• 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

Cites work

• An annotated bibliography on 1-planarity
• An upper bound on the number of edges in an almost planar bipartite graph
• Cyclic 4-colorings of graphs on surfaces
• Ein 7-Farbensatz 1-einbettbarer Graphen auf der projektiven Ebene
• Ein Sechsfarbenproblem auf der Kugel
• Optimal 1-embedded graphs on the projective plane which triangulate other surfaces

Cited in

(1)

• scientific article; zbMATH DE number 2172769 (Why is no real title available?)

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)