Jean-Pierre Nzali - Propriétés d'un circuit graphe minimum

arima:2554 - Revue Africaine de la Recherche en Informatique et Mathématiques Appliquées, August 27, 2005, Volume 2, 2004-2005 - https://doi.org/10.46298/arima.2554
Propriétés d'un circuit graphe minimum

Authors: Jean-Pierre Nzali

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.


Volume: Volume 2, 2004-2005
Published on: August 27, 2005
Submitted on: February 19, 2005
Keywords: Planar topologic graph, graph circuit, map, reversal degree, chinese postman problem.,degré de retournement,problème du postier chinois.,graphe planaire topologique,circuit graphe,carte,[INFO] Computer Science [cs],[MATH] Mathematics [math]


Share

Consultation statistics

This page has been seen 101 times.
This article's PDF has been downloaded 139 times.