Hal will be stopped for maintenance from friday on june 10 at 4pm until monday june 13 at 9am. More information
Skip to Main content Skip to Navigation
Journal articles

Propriétés d'un circuit graphe minimum

Abstract : A graph circuit is a planar graph in which edges are oriented such that any finite face is a circuit. Such graph is said to be minimum if the number of edges oriented in two direction is minimum. In this article we study such graph properties. We prove that each finite face can be characterized by its orientation direction. We also present sum results on the disposition of edges oriented in two directions in a minimum graph circuit.
Document type :
Journal articles
Complete list of metadata

Cited literature [8 references]  Display  Hide  Download

Contributor : Coordination Episciences Iam Connect in order to contact the contributor
Submitted on : Monday, January 25, 2016 - 5:12:33 PM
Last modification on : Tuesday, December 7, 2021 - 5:50:03 PM
Long-term archiving on: : Tuesday, April 26, 2016 - 11:36:23 AM


Publisher files allowed on an open archive




Jean-Pierre Nzali. Propriétés d'un circuit graphe minimum. Revue Africaine de la Recherche en Informatique et Mathématiques Appliquées, INRIA, 2005, Volume 2, 2004-2005, pp.19-41. ⟨10.46298/arima.2554⟩. ⟨hal-01261704⟩



Record views


Files downloads