Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

The Edge Reconstruction of \(3\)-Connected Projective Graphs With Minimum Valency \(5\) gvy

Yue Zhao1
1Department of Mathematics, Ohio State University Columbus, Ohio 43210
  • Published: 31/10/1993

Abstract

In this paper, we prove that \(3\)-connected projective graphs with minimum valency \(5\) are edge reconstructible.

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Yue Zhao. The Edge Reconstruction of \(3\)-Connected Projective Graphs With Minimum Valency \(5\) gvy[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 014. 61-64. .