On graphs determining links with maximal number of components via medial construction

DOI10.1016/j.dam.2009.06.006zbMath1213.05139OpenAlexW2090656640MaRDI QIDQ967365

Xian'an Jin, Eng Guan Tay, Fengming Dong

Publication date: 28 April 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.06.006

zbMATH Keywords

plane graphlink diagramcomponent numberextremal characterization

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (4)

On plane graphs with link component number equal to the nullity ⋮ The number of circles of a maximum state of a plane graph with applications ⋮ Extremal embedded graphs ⋮ DETERMINING THE COMPONENT NUMBER OF LINKS CORRESPONDING TO TRIANGULAR AND HONEYCOMB LATTICES

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Tutte polynomial for signed graphs
• Straight-ahead walks in Eulerian graphs
• A polynomial invariant for knots via von Neumann algebras
• New Invariants in the Theory of Knots
• Tutte Polynomials and Link Polynomials
• The Enumeration of Homeomorphically Irreducible Star Graphs
• A Contribution to the Theory of Chromatic Polynomials

This page was built for publication: On graphs determining links with maximal number of components via medial construction