Geodesic
Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs
Discrete mathematics & theoretical computer science, Tome 16 (2014) no. 3.

Voir la notice de l'article provenant de la source Episciences

Graph Theory 
@article{DMTCS_2014_16_3_a9,
     author = {Duginov, Oleg},
     title = {Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {16},
     number = {3},
     year = {2014},
     doi = {10.46298/dmtcs.2090},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2090/}
}
TY  - JOUR
AU  - Duginov, Oleg
TI  - Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs
JO  - Discrete mathematics & theoretical computer science
PY  - 2014
VL  - 16
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2090/
DO  - 10.46298/dmtcs.2090
LA  - en
ID  - DMTCS_2014_16_3_a9
ER  - 
%0 Journal Article
%A Duginov, Oleg
%T Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs
%J Discrete mathematics & theoretical computer science
%D 2014
%V 16
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2090/
%R 10.46298/dmtcs.2090
%G en
%F DMTCS_2014_16_3_a9
Duginov, Oleg. Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs. Discrete mathematics & theoretical computer science, Tome 16 (2014) no. 3. doi : 10.46298/dmtcs.2090. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.2090/

Cité par Sources :