Geodesic
Search elimination of bipartite graphs on 15 vertices
Daghestan Electronic Mathematical Reports, Tome 5 (2016), pp. 20-24.

Voir la notice de l'article provenant de la source Math-Net.Ru

The set $M$ of all connected bipartite graphs on 15 vertices selected subset of the low-power $M_0$, such that for each graph of $M$ is a subset of $M_0$ contains an isomorphic graph.
Keywords: bipartite graph, isomorphism, algorithm, colors. 
@article{DEMR_2016_5_a2,
     author = {A. M. Magomedov},
     title = {Search elimination of bipartite graphs on 15 vertices},
     journal = {Daghestan Electronic Mathematical Reports},
     pages = {20--24},
     publisher = {mathdoc},
     volume = {5},
     year = {2016},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DEMR_2016_5_a2/}
}
TY  - JOUR
AU  - A. M. Magomedov
TI  - Search elimination of bipartite graphs on 15 vertices
JO  - Daghestan Electronic Mathematical Reports
PY  - 2016
SP  - 20
EP  - 24
VL  - 5
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DEMR_2016_5_a2/
LA  - ru
ID  - DEMR_2016_5_a2
ER  - 
%0 Journal Article
%A A. M. Magomedov
%T Search elimination of bipartite graphs on 15 vertices
%J Daghestan Electronic Mathematical Reports
%D 2016
%P 20-24
%V 5
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DEMR_2016_5_a2/
%G ru
%F DEMR_2016_5_a2
A. M. Magomedov. Search elimination of bipartite graphs on 15 vertices. Daghestan Electronic Mathematical Reports, Tome 5 (2016), pp. 20-24. http://geodesic.mathdoc.fr/item/DEMR_2016_5_a2/

[1] Giaro K., Compact task scheduling on dedicated processors with no waiting period, PhD thesis, Technical University of Gdansk, IETI Faculty, Gdansk, 1999 (in Polish)

[2] Sevastyanov S.V., “Ob intervalnoi raskrashivaemosti reber dvudolnogo grafa”, Metody diskretnogo analiza, 50 (1990), 61–72 | Zbl

[3] Karp R.M., “Reducibility among combinatorial problems”, Complexity of Computer Computations, Plenum Press, New York, 1972, 85–103 | DOI | MR

[4] Magomedov A.M., “Tsepochechnye struktury v zadachakh o raspisaniyakh”, Prikladnaya diskretnaya matematika, 3 (2016), 67–77