On plane graphs with link component number equal to the nullity
From MaRDI portal
Publication:423970
DOI10.1016/J.DAM.2011.11.028zbMATH Open1239.05043OpenAlexW2088216617MaRDI QIDQ423970FDOQ423970
Authors: Yuefeng Lin, Steven D. Noble, Xianan Jin, Wenfang 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
Recommendations
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)
Cites Work
- Graph theory
- A Contribution to the Theory of Chromatic Polynomials
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the Principal Edge Tripartition of a Graph
- 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
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- DETERMINING THE COMPONENT NUMBER OF LINKS CORRESPONDING TO LATTICES
- On graphs determining links with maximal number of components via medial construction
Cited In (6)
- The number of circles of a maximum state of a plane graph with applications
- On graphs determining links with maximal number of components via medial construction
- On the component number of links from plane graphs
- Connected plane graphs with \(\min(\delta_v,\delta_f)=3\)
- The lune-free link graphs with 10-vertices
- Extremal embedded graphs
This page was built for publication: On plane graphs with link component number equal to the nullity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q423970)
