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

https://hal.inria.fr/hal-01261704
Contributor : Coordination Episciences Iam <>
Submitted on : Monday, January 25, 2016 - 5:12:33 PM
Last modification on : Wednesday, January 20, 2021 - 3:06:15 AM
Long-term archiving on: : Tuesday, April 26, 2016 - 11:36:23 AM

File

00202.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01261704, version 1

Collections

Citation

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, 2, pp.19-41. ⟨hal-01261704⟩

Share

Metrics

Record views

212

Files downloads

953