Making a \(C_6\)-free graph \(C_4\)-free and bipartite (Q298970)

From MaRDI portal
Revision as of 21:15, 19 June 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Making a \(C_6\)-free graph \(C_4\)-free and bipartite
scientific article

    Statements

    Making a \(C_6\)-free graph \(C_4\)-free and bipartite (English)
    0 references
    0 references
    0 references
    0 references
    21 June 2016
    0 references

    Identifiers