Extremal embedded graphs
From MaRDI portal
Publication:5217098
DOI10.26493/1855-3974.1474.d54zbMath1433.05171OpenAlexW2995912739MaRDI QIDQ5217098
Publication date: 21 February 2020
Published in: Ars Mathematica Contemporanea (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.26493/1855-3974.1474.d54
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15) Graph minors (05C83)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The link component number of suspended trees
- A polynomial of graphs on surfaces
- Bipartite minors
- On graphs determining links with maximal number of components via medial construction
- Generalized duality for graphs on surfaces and the signed Bollobás-Riordan polynomial
- Remarkable valuation of the dichromatic polynomial of planar multigraphs
- Straight-ahead walks in Eulerian graphs
- Excluded Minors and the Ribbon Graphs of Knots
- Embedded graphs whose links have the largest possible number of components
- Graphs on Surfaces
- A Contribution to the Theory of Chromatic Polynomials
- DETERMINING THE COMPONENT NUMBER OF LINKS CORRESPONDING TO LATTICES