Embedded graphs whose links have the largest possible number of components
From MaRDI portal
Publication:2950077
DOI10.26493/1855-3974.494.88EzbMath1329.05084OpenAlexW2128018283WikidataQ129355277 ScholiaQ129355277MaRDI QIDQ2950077
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
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 (1)
This page was built for publication: Embedded graphs whose links have the largest possible number of components