theory, the bipartite half or half-square of a bipartite graph G = (U,V,E) is a graph whose vertex set is one of the two sides of the bipartition (without...

the complement of the Petersen graph, which can also be formed as the bipartite half of the 20-vertex Desargues graph. There are several different ways of...

combinatorially as the "half-squares of planar bipartite graphs". That is, let G = (U,V,E) be a planar bipartite graph, with bipartition (U,V). The square of...

mathematics, a half graph is a special type of bipartite graph. These graphs are called the half graphs because they have approximately half of the edges...

In graph theory, the bipartite double cover of an undirected graph G is a bipartite, covering graph of G, with twice as many vertices as G. It can be constructed...

whose Foster census of cubic symmetric graphs included this graph. The bipartite half of the Foster graph is a distance-regular graph and a locally linear...

complementary subset is as large as possible. Equivalently, one wants a bipartite subgraph of the graph with as many edges as possible. There is a more...

The bipartite realization problem is a classical decision problem in graph theory, a branch of combinatorics. Given two finite sequences ( a 1 , … , a...

to its inflection point; that is, it is invariant under a rotation of a half turn around this point. Up to an affine transformation, there are only three...

theory, a half-transitive graph is a graph that is both vertex-transitive and edge-transitive, but not symmetric. In other words, a graph is half-transitive...

of bipartite graphs are perfect. Examples include the rook's graphs, the line graphs of complete bipartite graphs. Every line graph of a bipartite graph...

the maximum matching problem and the minimum vertex cover problem in bipartite graphs. It was discovered independently, also in 1931, by Jenő Egerváry...

5-dimensional uniform 5-polytope, the 5-demicube. Because it is the bipartite half of a distance-regular graph, the halved cube graph is itself distance-regular...

together again give A. Such a partition is also frequently called a bipartition. The two parts thus formed are complements. In logic, the partitions...

square root of G2. The half-square of a bipartite graph is the subgraph of its square induced by one side of the bipartition. 2.  A squaregraph is a...

a bipartite graph is perfect (see Kőnig's theorem), but need not be bipartite as the example of the claw graph shows. The line graphs of bipartite graphs...

sequence ( H n ) {\displaystyle (H_{n})} of half-graphs, defined by taking H n {\displaystyle H_{n}} to be the bipartite graph on 2 n {\displaystyle 2n} vertices...

815 = 5 × 163, number of graphs with 8 vertices and a distinguished bipartite block 816 = 24 × 3 × 17, tetrahedral number, Padovan number, Zuckerman...

a problem in topological graph theory by asking whether the complete bipartite graph K 3 , 3 {\displaystyle K_{3,3}} , with vertices representing the...

two vertices, one on each side of the bipartition, such that each of these two vertices belongs to at most half of the graph's maximal independent sets...

example is a special case of the following general theorem:: 274  G is a bipartite graph if-and-only-if MP(G) = FMP(G) if-and-only-if all corners of FMP(G)...

half of the vertices. This definition includes the rooted products of a graph G and a one-edge graph. It also includes, for instance, the bipartite well-covered...

exempt w/o = Walkover r = Retired d = Defaulted SR = Special ranking BPC = Bipartite Invitation "Wheelchair Tennis - Men's Singles Schedule". Tokyo 2020 Paralympics...

In graph theory, a branch of mathematics, the Herschel graph is a bipartite undirected graph with 11 vertices and 18 edges. It is a polyhedral graph (the...

coloring algorithm will use three colors for the whole graph. The complete bipartite graphs are the only connected graphs whose Grundy number is two. All other...

most 3. For bipartite graphs, the equivalence between vertex cover and maximum matching described by Kőnig's theorem allows the bipartite vertex cover...

prematurely ended after it was revealed that he needed surgery to repair a bipartite patella. He finished the season batting .286/.343/.505 with 18 home runs...

connection to transversals of Latin squares. Denote by Kn,n the complete bipartite graph on n + n vertices. Every proper n-edge coloring of Kn,n corresponds...

these graphs are bipartite and have Hamiltonian paths, their maximum independent sets have a number of vertices that is equal to half of the number of...

graphs with an even number of vertices 2n, are the evenly split complete bipartite graphs Kn,n and the crown graphs on 2n vertices. Many other symmetric...