Matroids from directed graphs (Q1250104): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some characterization theorems for circuit spaces associated with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5656797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel concepts in graph theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: BICIRCULAR MATROIDS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infinite subgraphs as matroid circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3291034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Antidirected Hamiltonian paths in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: On subgraphs as matroid cells / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Matroids on Edge Sets of Graphs with Connected Subgraphs as Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: On matroids on edge sets of graphs with connected subgraphs as circuits. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111952 / rank
 
Normal rank

Latest revision as of 23:22, 12 June 2024

scientific article
Language Label Description Also known as
English
Matroids from directed graphs
scientific article

    Statements

    Identifiers