Results 11 to 20 of about 617,805 (269)
Small bipartite subgraph polytopes [PDF]
, 2010 We compute a complete linear description of the bipartite subgraph polytope, for up to seven nodes, and a conjectured complete description for eight nodes.
Galli, L, Letchford, A N
core +5 more sources
The Connectivity of a Bipartite Graph and Its Bipartite Complementary Graph [PDF]
Parallel Processing Letters, 2020 In 1956, Nordhaus and Gaddum gave lower and upper bounds on the sum and the product of the chromatic number of a graph and its complement, in terms of the order of the graph. Since then, any bound on the sum and/or the product of an invariant in a graph [Formula: see text] and the same invariant in the complement [Formula: see text] of [Formula: see ...
Yingzhi Tian, Huaping Ma, Liyun Wu
openaire +4 more sources
On bipartite‐mixed graphs [PDF]
Journal of Graph Theory, 2018 AbstractMixed graphs can be seen as digraphs that have both arcs and edges (or digons, that is, two opposite arcs). In this article, we consider the case where such graphs are bipartite. As main results, we show that in this context the Moore‐like bound is attained in the case of diameter , and that bipartite‐mixed graphs of diameter do not exist.
Dalfó Simó, Cristina +2 more
openaire +4 more sources
Packing bipartite graphs with covers of complete bipartite graphs [PDF]
Discrete Applied Mathematics, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chalopin, Jérémie, Paulusma, Daniël
openaire +5 more sources
Concatenating Bipartite Graphs
The Electronic Journal of Combinatorics, 2022 Let $x,y\in (0,1]$, and let $A,B,C$ be disjoint nonempty stable subsets of a graph $G$, where every vertex in $A$ has at least $x|B|$ neighbours in $B$, and every vertex in $B$ has at least $y|C|$ neighbours in $C$, and there are no edges between $A,C$.
Maria Chudnovsky +4 more
openaire +4 more sources
Inverses of Bipartite Graphs [PDF]
Combinatorica, 2017 9 pages, 2 ...
Yujun Yang, Dong Ye 0002
openaire +4 more sources
Embedding into Bipartite Graphs [PDF]
SIAM Journal on Discrete Mathematics, 2010 The conjecture of Bollobás and Komlós, recently proved by Böttcher, Schacht, and Taraz [Math. Ann. 343(1), 175--205, 2009], implies that for any $γ>0$, every balanced bipartite graph on $2n$ vertices with bounded degree and sublinear bandwidth appears as a subgraph of any $2n$-vertex graph $G$ with minimum degree $(1+γ)n$, provided that $n$ is ...
Julia Böttcher +2 more
openaire +3 more sources
Enumeration of Bipartite Graphs and Bipartite Blocks [PDF]
The Electronic Journal of Combinatorics, 2014 We use the theory of combinatorial species to count unlabelled bipartite graphs and bipartite blocks (nonseparable or 2-connected graphs). We start with bicolored graphs, which are bipartite graphs that are properly colored in two colors. The two-element group $\mathfrak{S}_2$ acts on these graphs by switching the colors, and connected bipartite graphs
Andrew Gainer-Dewar, Ira M. Gessel
openaire +4 more sources
Revisiting Volgenant-Jonker for Approximating Graph Edit Distance [PDF]
, 2015 Although it is agreed that the Volgenant-Jonker (VJ) algorithm provides a fast way to approximate graph edit distance (GED), until now nobody has reported how the VJ algorithm can be tuned for this task.
Andy King +5 more
core +1 more source
Bipartite Domination in Graphs
Mathematica Pannonica, 2022 The bipartite domination number of a graph is the minimum size of a dominating set that induces a bipartite subgraph. In this paper we initiate the study of this parameter, especially bounds involving the order, the ordinary domination number, and the chromatic number.
Bachstein, Anna +2 more
openaire +2 more sources