Search elimination of bipartite graphs on 15 vertices

A. M. Magomedov

Daghestan Scientific Centre of RAS

Abstract: 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.

UDC: 681.142.1

Received: 05.05.2016
Revised: 28.06.2016
Accepted: 29.06.2016

DOI: 10.31029/demr.5.3

Bibliographic databases:

•