Results 191 to 200 of about 143,400 (232)
Some of the next articles are maybe not open access.
Paintability of complete bipartite graphs
Discrete Applied Mathematics, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Masaki Kashima
semanticscholar +3 more sources
Complete (2,2) Bipartite Graphs
Malaysian Journal of Mathematical Sciences, 2022A bipartite graph G can be treated as a (1,1) bipartite graph in the sense that, no two vertices in the same part are at distance one from each other. A (2,2) bipartite graph is an extension of the above concept in which no two vertices in the same part are at distance two from each other.
Hanif, S., Bhat, K. A., Sudhakara, G.
openaire +1 more source
On bisections of graphs without complete bipartite graphs
Journal of Graph Theory, 2021A bisection of a graph is a bipartition of its vertex set in which the two classes differ in size by at most one. For a random bisection of a graph with m edges, one expects m ∕ 4 edges spans in one vertex class.
Jianfeng Hou, Shufei Wu
semanticscholar +1 more source
The complete bipartite graphs with a unique edge‐transitive embedding
Journal of Graph Theory, 2018Wenwen Fan, Caiheng Li
semanticscholar +3 more sources
Efficient Biclique Counting in Large Bipartite Graphs
Proc. ACM Manag. Data, 2023Xiaowei Ye +4 more
semanticscholar +3 more sources
Packings by Complete Bipartite Graphs
SIAM Journal on Algebraic Discrete Methods, 1986Summary: Given any set \({\mathcal B}\) of complete bipartite graphs, we ask whether a graph H admits a \({\mathcal B}\)-factor, i.e., a spanning subgraph, each of whose components is a member of \({\mathcal B}\). More generally, we seek in H a maximum \({\mathcal B}\)-packing, i.e., a \({\mathcal B}\)-factor of a maximum size subgraph of H.
Hell, P., Kirkpatrick, D. G.
openaire +1 more source
Strong Geodetic Number of Complete Bipartite Graphs and of Graphs with Specified Diameter
Graphs and Combinatorics, 2017The strong geodetic problem is a recent variation of the classical geodetic problem. For a graph G, its strong geodetic number sg(G)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb ...
Vesna Iršič
semanticscholar +1 more source
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
Ramsey Numbers of Complete Bipartite Graphs
Graphs and CombinatoricszbMATH Open Web Interface contents unavailable due to conflicting licenses.
Liu, Meng, Du, Bangwei
openaire +1 more source
Complete bipartite graphs deleted in Ramsey graphs
Theoretical Computer Science, 2020zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Li, Yan, Li, Yusheng, Wang, Ye
openaire +2 more sources