Edge‐maximal graphs on orientable and some nonorientable surfaces

DOI10.1002/jgt.22705zbMath1522.05062arXiv1911.02666OpenAlexW3177562069MaRDI QIDQ6056751

Florian Pfender, James E. Davies

Publication date: 4 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.02666

zbMATH Keywords

graph embeddingimpure graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

On the dichromatic number of surfaces ⋮ Robust Connectivity of Graphs on Surfaces ⋮ Covering projective planar graphs with three forests

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Wie man die geschlossenen nichtorientierbaren Flächen in möglichst wenig Dreiecke zerlegen kann
• Minimal triangulations on orientable surfaces
• A minimum-vertex triangulation
• On the purity of minor-closed classes of graphs
• Locally Hamiltonian graphs and minimal size of maximal graphs on a surface
• Non-separating planar graphs
• Homomorphiesätze für Graphen
• The genus of subgraphs of \(K_ 8\)
• Knots and links in spatial graphs
• A Maximal Toroidal Graph which is not a Triangulation.
• Edge-Maximal Graphs on Surfaces
• Face distributions of embeddings of complete graphs
• Maximal knotless graphs

This page was built for publication: Edge‐maximal graphs on orientable and some nonorientable surfaces