Finding large matchings in 1-planar graphs of minimum degree 3 (Q2110625)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Finding large matchings in 1-planar graphs of minimum degree 3
scientific article

    Statements

    Finding large matchings in 1-planar graphs of minimum degree 3 (English)
    0 references
    0 references
    0 references
    21 December 2022
    0 references

    Identifiers