𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Connected coverings and an application to oriented matroids

✍ Scribed by David Forge; J.L. Rami´rez Alfonsi´n

Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
480 KB
Volume
187
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper we are interested in the following question: what is the smallest number of circuits, s(n,r), that is sufficient to determine every uniform oriented matroid of rank r on n elements? We shall give different upper bounds for s(n,r) by using special coverings called connected coverings. (~

📜 SIMILAR VOLUMES

Coverings and Minors: Application to Loc
Coverings and Minors: Application to Local Computations in Graphs
✍ Bruno Courcelle; Yves Métivier 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 398 KB

Using the notion of covering, we prove that a minor-closed class of graphs cannot be recognized by local computations, except in a few special cases.

Cell rotation graphs of strongly connect
Cell rotation graphs of strongly connected orientations of plane graphs with an application
✍ Heping Zhang; Peter Che Bor Lam; Wai Chee Shiu 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 345 KB

The cell rotation graph D(G) on the strongly connected orientations of a 2-edge-connected plane graph G is deÿned. It is shown that D(G) is a directed forest and every component is an in-tree with one root; if T is a component of D(G), the reversions of all orientations in T induce a component of D(

An object oriented approach to web-based
An object oriented approach to web-based applications design
✍ Schwabe, Daniel; Rossi, Gustavo 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 653 KB

In this paper we discuss the use of an object-oriented approach for web-based applications design, based on a method named Object-Oriented Hypermedia Design Method (OOHDM). We first motivate our work discussing the problems encountered while designing large scale, dynamic webbased applications, whi