Extremal embedded graphs
From MaRDI portal
Recommendations
Cites work
- A Contribution to the Theory of Chromatic Polynomials
- A polynomial of graphs on surfaces
- Bipartite minors
- DETERMINING THE COMPONENT NUMBER OF LINKS CORRESPONDING TO LATTICES
- Embedded graphs whose links have the largest possible number of components
- Excluded minors and the ribbon graphs of knots
- Generalized duality for graphs on surfaces and the signed Bollobás-Riordan polynomial
- Graphs on surfaces
- Graphs on surfaces. Dualities, polynomials, and knots
- scientific article; zbMATH DE number 4006288 (Why is no real title available?)
- scientific article; zbMATH DE number 3683624 (Why is no real title available?)
- scientific article; zbMATH DE number 3480634 (Why is no real title available?)
- scientific article; zbMATH DE number 1850583 (Why is no real title available?)
- On graphs determining links with maximal number of components via medial construction
- Remarkable valuation of the dichromatic polynomial of planar multigraphs
- Straight-ahead walks in Eulerian graphs
- The link component number of suspended trees
Cited in
(7)- Acquisition-extremal graphs
- Excluded minors and the ribbon graphs of knots
- scientific article; zbMATH DE number 5989950 (Why is no real title available?)
- Extremal traceable graphs with non-traceable edges
- New results for non-interpolating partial-dual Euler-genus polynomials
- Eulerian and even-face ribbon graph minors
- On graphs determining links with maximal number of components via medial construction
This page was built for publication: Extremal embedded graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5217098)