A note on mixed graphs and matroids

Simple item page
dc.creatorCerdeira, J. Orestes
dc.creatorCordovil, Raul
dc.date2003-10-06
dc.date.accessioned2026-07-07T05:01:39Z
dc.date.available2026-07-07T05:01:39Z
dc.descriptionA mixed graph is a graph with some directed edges and some undirected edges. We introduce the notion of mixed matroids as a generalization of mixed graphs. A mixed matroid can be viewed as an oriented matroid in which the signs over a fixed subset of the ground set have been forgotten. We extend to mixed matroids standard definitions from oriented matroids, establish basic properties, and study questions regarding the reorientations of the unsigned elements. In particular we address in the context of mixed matroids the P-connectivity and P-orientability issues which have been recently introduced for mixed graphs.
dc.description6 pages, 1 figure
dc.identifierhttps://arxiv.org/abs/math/0310078
dc.identifierhttp://arxiv.org/abs/math/0310078
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/68758
dc.subjectCombinatorics
dc.subject05B35; 05C38
dc.titleA note on mixed graphs and matroids
dc.typetext

Files

Collections

arXiv