DC pole | Wartość | Język |
dc.contributor.author | Kawa, Renata | - |
dc.date.accessioned | 2020-09-22T07:45:16Z | - |
dc.date.available | 2020-09-22T07:45:16Z | - |
dc.date.issued | 2010 | - |
dc.identifier.citation | Discussiones Mathematicae GraphTheory, Vol. 30, no. 3 (2010), s. 437-447 | pl_PL |
dc.identifier.issn | 2083-5892 | - |
dc.identifier.issn | 1234-3099 | - |
dc.identifier.uri | http://hdl.handle.net/20.500.12128/16057 | - |
dc.description.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]. | pl_PL |
dc.language.iso | en | pl_PL |
dc.rights | Uznanie autorstwa-Użycie niekomercyjne-Bez utworów zależnych 3.0 Polska | * |
dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/3.0/pl/ | * |
dc.subject | matroid | pl_PL |
dc.subject | matroidal family | pl_PL |
dc.title | Graphs for n-circular matroids | pl_PL |
dc.type | info:eu-repo/semantics/article | pl_PL |
dc.identifier.doi | 10.7151/dmgt.1505 | - |
Pojawia się w kolekcji: | Artykuły (WNŚiT)
|