Contents

Ars Combinatoria

  • Research article

Upon the Existence of a Removable Circuit in a Simple \(3\)-Connected Eulerian Graph.

Philip Andrew Sinclair1
1 The British University in Egypt, EI Sherouk City, Misr-Ismalia Desert Road, Postal No. 11837, BO. Box 43, Egypt
  • Published: 31/10/2008
Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

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

Citation
Philip Andrew Sinclair. Upon the Existence of a Removable Circuit in a Simple \(3\)-Connected Eulerian Graph.[J], Ars Combinatoria, Volume 089. 383-400. .