Minimally 3-connected binary matroids (Q942146): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejc.2007.07.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2050456793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple theorem on 3-connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On matroid connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimally 3-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On 3-connected matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Connectivity in Matroids and Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON MATROID CONNECTIVITY / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3135082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4717848 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of 3-connected matroids and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of regular matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connectivity in Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly 3-Connected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Vertex-Triads in 3-Connected Binary Matroids / rank
 
Normal rank

Latest revision as of 16:13, 28 June 2024

scientific article
Language Label Description Also known as
English
Minimally 3-connected binary matroids
scientific article

    Statements

    Minimally 3-connected binary matroids (English)
    0 references
    0 references
    0 references
    4 September 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    minimal 3 connected graphs
    0 references
    minimally 3 connected matroids
    0 references
    minimal 3 connected binary matroids
    0 references
    spoked wheel
    0 references
    Fano dual
    0 references
    0 references