Results 191 to 200 of about 92,446 (202)
Some of the next articles are maybe not open access.
Canadian Journal of Mathematics, 1958
For the purpose of analysing bipartite graphs (hereinafter called simply graphs) the concept of an exterior covering is introduced. In terms of this concept it is possible in a natural way to decompose any graph into two parts, an inadmissible part and a core.
Dulmage, A. L., Mendelsohn, N. S.
openaire +1 more source
For the purpose of analysing bipartite graphs (hereinafter called simply graphs) the concept of an exterior covering is introduced. In terms of this concept it is possible in a natural way to decompose any graph into two parts, an inadmissible part and a core.
Dulmage, A. L., Mendelsohn, N. S.
openaire +1 more source
Bipartite graphs as polynomials and polynomials as bipartite graphs
Journal of Algebra and Its Applications, 2020The aim of this paper is to show that any finite undirected bipartite graph can be considered as a polynomial [Formula: see text], and any directed finite bipartite graph can be considered as a polynomial [Formula: see text], and vise verse. We also show that the multiplication in the semirings [Formula: see text], [Formula: see text] corresponds to an
Grinblat, Andrey, Lopatkin, Viktor
openaire +2 more sources
BIPARTITE PERMUTATION GRAPHS ARE RECONSTRUCTIBLE
Discrete Mathematics, Algorithms and Applications, 2010The graph reconstruction conjecture is a long-standing open problem in graph theory. The conjecture has been verified for all graphs with at most 11 vertices. Further, the conjecture has been verified for regular graphs, trees, disconnected graphs, unit interval graphs, separable graphs with no pendant vertex, outer-planar graphs, and unicyclic graphs.
Kiyomi, Masashi +2 more
openaire +1 more source
Constructing Unstable Graphs from Bipartite Graphs
Bulletin of the Malaysian Mathematical Sciences SocietyzbMATH Open Web Interface contents unavailable due to conflicting licenses.
Haiyan Jiang, Junyang Zhang
openaire +2 more sources
Packing two bipartite graphs into a complete bipartite graph
Journal of Graph Theory, 1997A bipartite graph \(G\) admits an \((a,b)\)-bipartition if \(G\) has a bipartition \((X,Y)\) such that \(|X|=a\) and \(|Y|=b\). Two bipartite graphs \(G\) and \(H\) are compatible if, for some integers \(a\) and \(b\), both \(G\) and \(H\) admit an \((a,b)\)-bipartition. In the paper it is proved that any two compatible \(C_4\)-free bipartite graphs of
openaire +2 more sources
Graph Coloring on Bipartite Graphs
International Journal of Mathematical, Engineering, Biological and Applied Computing, 2022Balakrishnan Sennaiyan +1 more
openaire +1 more source

