Embedded graphs whose links have the largest possible number of components

DOI10.26493/1855-3974.494.88EMaRDI QIDQ2950077zbMATH OpenOpenAlexWikidataFDO

Authors Stephen Huggett, Israa Tawfik

Publication date 5 October 2015

Published in Ars Mathematica Contemporanea (Search for Journal in Brave)

Full work available at URL https://doi.org/10.26493/1855-3974.494.88e

zbMATH Keywords

components of linksembedded graphsmedial

Mathematics Subject Classification ID

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

Cited in

(2)

• Extremal embedded graphs
• The maximum and minimum genus of a multibranched surface

This page was built for publication: Embedded graphs whose links have the largest possible number of components

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