On plane graphs with link component number equal to the nullity

DOI10.1016/j.dam.2011.11.028zbMath1239.05043OpenAlexW2088216617MaRDI QIDQ423970

Xian'an Jin, Steven D. Noble, Yuefeng Lin, Wenfang (Wendy) Cheng

Publication date: 30 May 2012

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

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

zbMATH Keywords

Tutte polynomialnullitybicycle spacelink component numbernear-extremal graphs

Mathematics Subject Classification ID

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

Related Items

The number of circles of a maximum state of a plane graph with applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On graphs determining links with maximal number of components via medial construction
• Remarkable valuation of the dichromatic polynomial of planar multigraphs
• Plane graphs with Eulerian Petrie walks
• Straight-ahead walks in Eulerian graphs
• Tutte Polynomials and Link Polynomials
• On the Principal Edge Tripartition of a Graph
• A Contribution to the Theory of Chromatic Polynomials
• DETERMINING THE COMPONENT NUMBER OF LINKS CORRESPONDING TO LATTICES