We prove that the matching graph M ( Q d ) of the d-dimensional hypercube is bipartite for d ≥ 2 and connected for d ≥ 4. This proves another Kreweras' conjecture [G. Kreweras: Matchings and Hamiltonian cycles on hypercubes, Bull. Inst. Combin. Appl. 16 (1996) 87–91] that the...
必应词典为您提供Complete-Matching的释义,un. 完全匹配;完全对齐;完全对象;完全对集; 网络释义: 完整匹配;完成匹配;完备匹配;
complete graph complete induction complete inference system complete integral complete joint penetration complete lattice complete leaf complete learning method complete limit complete linear topological space complete lubrication complete matching complete metric space ...
Rainbow Perfect Matchings in Complete Bipartite Graphs: Existence and Counting A perfect matching M in an edge-coloured complete bipartite graph Kn,n is rainbow if no pair of edges in M have the same colour. We obtain ... PERARNAU, GUILLEM,SERRA, ORIOL - 《Combinatorics Probability & Computin...
Consequently, G must be a bipartite graph with partition classes A and B such that f(A)=X and f(B)=Y. Due to Proposition 1, we then find that |A|=knk+ℓ and |B|=ℓnk+ℓ. By the same proposition, we find that each G[xi,yj] contains a perfect matching Mij. We define ...
The exact perfect matching problem asks for a perfect matching in a red-blue graph that has exactly a given number of red edges.We show that for complete and bipartite complete graphs, the exact perfect matching problem is logspace equivalent to the perfect match- ing problem. Hence an ...
2、rected graph with total weight less than w? does this bipartite graph have a perfect (all nodes matched) matching? does the pattern p appear as a substring in text t? p p is the set of decision problems that can be solved in worst-case polynomial time: if the input is of size ...
This paper deals with the Efficient Edge Domination Problem (EED, for short), also known as Dominating Induced Matching Problem. For an undirected graph G ... A Brandstdt,C Hundt,R Nevries - Latin: Theoretical Informatics, Latin American Symposium, Oaxaca, Mexico, April 被引量: 52发表: 20...
Acyclic edge coloring Acyclic edge chromatic index Matching Complete bipartite graphs All graphs considered in this paper are finite and simple. A proper edge coloring of G=(V,E) is a map c:E→C (where C is the set of available colors) with c(e)≠c(f) for any adjacent edges e,f....
The on-line versions of the problem in which the vertices and/or edges of the graph are given one at a time and an algorithm has to calculate a matching incrementally have been studied for more than two decades. Many variants of the problem are considered in the literature. The pioneering...