z-logo
open-access-imgOpen Access
Partitioning the edge set of a bipartite graph into the minimal number of subgraphs isomorphic to those of a simple 4 order cycle
Author(s) -
О. И. Дугинов,
S. S. Khimich
Publication year - 2022
Publication title -
vescì nacyânalʹnaj akadèmìì navuk belarusì. seryâ fìzìka-matèmatyčnyh navuk
Language(s) - English
Resource type - Journals
eISSN - 2524-2415
pISSN - 1561-2430
DOI - 10.29235/1561-2430-2022-58-2-155-168
Subject(s) - bipartite graph , combinatorics , mathematics , simple (philosophy) , discrete mathematics , graph , computer science , theoretical computer science , philosophy , epistemology

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here