scientific article; zbMATH DE number 640515

MaRDI QIDQ4306325zbMATH OpenFDO

Authors Hongbing Fan

Publication date 15 March 1995

zbMATH Keywords

minimum degreeplanar graphsedge-reconstructible3-connected vertex

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cited in

(12)

• On the reconstruction of planar graphs
• Almost every graph has a fixed edge
• scientific article; zbMATH DE number 810437 (Why is no real title available?)
• Edge-reconstruction of minimally 3-connected planar graphs
• scientific article; zbMATH DE number 4125435 (Why is no real title available?)
• On the edge reconstruction of graphs embedded in surfaces. III
• scientific article; zbMATH DE number 4087701 (Why is no real title available?)
• scientific article; zbMATH DE number 647773 (Why is no real title available?)
• scientific article; zbMATH DE number 719415 (Why is no real title available?)
• Efficient reassembling of three-regular planar graphs
• On the fixed edge of planar graphs with minimum degree five
• scientific article; zbMATH DE number 549476 (Why is no real title available?)

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4306325)