The equitable chromatic threshold of the Cartesian product of bipartite graphs is at most 4 (Q514702)

From MaRDI portal
Revision as of 15:40, 22 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
The equitable chromatic threshold of the Cartesian product of bipartite graphs is at most 4
scientific article

    Statements

    The equitable chromatic threshold of the Cartesian product of bipartite graphs is at most 4 (English)
    0 references
    0 references
    0 references
    0 references
    9 March 2017
    0 references

    Identifiers