Skip navigation

Please use this identifier to cite or link to this item: http://hdl.handle.net/20.500.12128/16057
Title: Graphs for n-circular matroids
Authors: Kawa, Renata
Keywords: matroid; matroidal family
Issue Date: 2010
Citation: Discussiones Mathematicae GraphTheory, Vol. 30, no. 3 (2010), s. 437-447
Abstract: We give ”if and only if” characterization of graphs with the following property: given n > 3, edges of such graphs form matroids with circuits from the collection of all graphs with n fundamental cycles. In this way we refer to the notion of matroidal family defined by Simoes-Pereira [2].
URI: http://hdl.handle.net/20.500.12128/16057
DOI: 10.7151/dmgt.1505
ISSN: 2083-5892
1234-3099
Appears in Collections:Artykuły (WNŚiT)

Files in This Item:
File Description SizeFormat 
Kawa_Graphs_for_circular_matroids.pdf355,93 kBAdobe PDFView/Open
Show full item record


Uznanie autorstwa - użycie niekomercyjne, bez utworów zależnych 3.0 Polska Creative Commons License Creative Commons