Recognizing graphic matroids (Q1172064): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56430158, #quickstatements; #temporary_batch_1711626644914
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Converting Linear Programs to Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong maps of geometries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Matroid Property Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of matroid properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Determining Whether a Given Binary Matroid is Graphic / rank
 
Normal rank

Latest revision as of 16:32, 13 June 2024

scientific article
Language Label Description Also known as
English
Recognizing graphic matroids
scientific article

    Statements

    Recognizing graphic matroids (English)
    0 references
    0 references
    1981
    0 references
    polygon-matroid
    0 references
    graphicness testing
    0 references
    cocircuit
    0 references

    Identifiers