This HTML5 document contains 52 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n16https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
wikipedia-enhttp://en.wikipedia.org/wiki/
provhttp://www.w3.org/ns/prov#
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Bicircular_matroid
rdf:type
dbo:Agent
rdfs:label
Bicircular matroid
rdfs:comment
In the mathematical subject of matroid theory, the bicircular matroid of a graph G is the matroid B(G) whose points are the edges of G and whose independent sets are the edge sets of pseudoforests of G, that is, the edge sets in which each connected component contains at most one cycle. The bicircular matroid was introduced by and explored further by and others. It is a special case of the frame matroid of a biased graph.
dcterms:subject
dbc:Graph_theory dbc:Matroid_theory
dbo:wikiPageID
13511620
dbo:wikiPageRevisionID
1093611583
dbo:wikiPageWikiLink
dbr:Tree_(graph_theory) dbc:Matroid_theory dbr:Biased_graph dbr:Transversal_matroid dbc:Graph_theory dbr:Graph_theory dbr:Frame_matroid dbr:Matroid dbr:Graphic_matroid dbr:Matroid_minor dbr:Finite_field dbr:Field_(mathematics) dbr:Family_of_sets dbr:Partial_ordering dbr:Matroid_representation dbr:Mathematische_Zeitschrift dbr:Circuit_rank dbr:Induced_subgraph dbr:Connected_component_(graph_theory) dbr:Cycle_(graph_theory) dbr:Quarterly_Journal_of_Mathematics dbr:Mathematics dbr:Graph_(discrete_mathematics) dbr:Gain_graph dbr:Glossary_of_graph_theory dbr:Regular_matroid dbr:Pseudoforest dbr:Geometric_lattice dbr:Journal_of_Combinatorial_Theory dbr:Multigraph
owl:sameAs
wikidata:Q4903641 freebase:m.03c7rff n16:4YVtt
dbp:wikiPageUsesTemplate
dbt:Short_description dbt:Hsp dbt:Harvtxt dbt:Harv dbt:Mvar dbt:Math dbt:Citation
dbo:abstract
In the mathematical subject of matroid theory, the bicircular matroid of a graph G is the matroid B(G) whose points are the edges of G and whose independent sets are the edge sets of pseudoforests of G, that is, the edge sets in which each connected component contains at most one cycle. The bicircular matroid was introduced by and explored further by and others. It is a special case of the frame matroid of a biased graph.
gold:hypernym
dbr:B
prov:wasDerivedFrom
wikipedia-en:Bicircular_matroid?oldid=1093611583&ns=0
dbo:wikiPageLength
6937
foaf:isPrimaryTopicOf
wikipedia-en:Bicircular_matroid