AbstractThe ratio of the number of edges in a smallest maximal matching to the number of vertices in the graph of the d-dimensional cube has limit 13 as d approaches infinity
Blair et. al. [3] have recently determined the maximum number of edges of a chordal graph with a max...
Given a graph G=(V,E), a subset M of E is called a matching if no two edges in M are adjacent. A mat...
International audienceGiven a positive integer n we find a graph G = (V, E) on |V | = n vertices wit...
AbstractThe ratio of the number of edges in a smallest maximal matching to the number of vertices in...
AbstractThe following combinatorial problem, which arose in game theory, is solved here: To find a s...
How many edges can there be in a maximum matching in a complete multipartite graph? Several cases wh...
AbstractAn induced matching M of a graph G is a set of pairwise non-adjacent edges such that their e...
AbstractWe look at the minimal size of a maximal matching in general, bipartite and d-regular random...
AbstractFor a graph G, consider the pairs of edge-disjoint matchings whose union consists of as many...
AbstractLet n, b, d be positive integers. We evaluate f(n, b, d), the largest possible number of edg...
Abstract. We look at the minimal size of a maximal matching in general, bipartite and ¡-regular rand...
A matching M of a graph G is a dominating induced matching (DIM) of G if every edge of G is either i...
[3] have recently determined the maximum number of edges of a chordal graph with a maximum degree le...
An induced matching M of a graph G is a set of pairwise non-adjacent edges such that their end-verti...
We determine the maximum possible number of edges of a graph with $n$ vertices, matching number at m...
Blair et. al. [3] have recently determined the maximum number of edges of a chordal graph with a max...
Given a graph G=(V,E), a subset M of E is called a matching if no two edges in M are adjacent. A mat...
International audienceGiven a positive integer n we find a graph G = (V, E) on |V | = n vertices wit...
AbstractThe ratio of the number of edges in a smallest maximal matching to the number of vertices in...
AbstractThe following combinatorial problem, which arose in game theory, is solved here: To find a s...
How many edges can there be in a maximum matching in a complete multipartite graph? Several cases wh...
AbstractAn induced matching M of a graph G is a set of pairwise non-adjacent edges such that their e...
AbstractWe look at the minimal size of a maximal matching in general, bipartite and d-regular random...
AbstractFor a graph G, consider the pairs of edge-disjoint matchings whose union consists of as many...
AbstractLet n, b, d be positive integers. We evaluate f(n, b, d), the largest possible number of edg...
Abstract. We look at the minimal size of a maximal matching in general, bipartite and ¡-regular rand...
A matching M of a graph G is a dominating induced matching (DIM) of G if every edge of G is either i...
[3] have recently determined the maximum number of edges of a chordal graph with a maximum degree le...
An induced matching M of a graph G is a set of pairwise non-adjacent edges such that their end-verti...
We determine the maximum possible number of edges of a graph with $n$ vertices, matching number at m...
Blair et. al. [3] have recently determined the maximum number of edges of a chordal graph with a max...
Given a graph G=(V,E), a subset M of E is called a matching if no two edges in M are adjacent. A mat...
International audienceGiven a positive integer n we find a graph G = (V, E) on |V | = n vertices wit...
DOI
Add to ORKG