DOIAbstract
AbstractLet ρ(n) denote the smallest integer with the property that any graph with n vertices can be covered by ρ(n) complete bipartite subgraphs. We prove a conjecture of J.-C. Bermond by showing ρ(n)=n+o(n1114+ϵ) for any positive ϵ
AbstractLet ρ(n) denote the smallest integer with the property that any graph with n vertices can be covered by ρ(n) complete bipartite subgraphs. We prove a conjecture of J.-C. Bermond by showing ρ(n)=n+o(n1114+ϵ) for any positive ϵ
AbstractA total cover of a graph G is a subset of V(G)∪E(G) which covers all elements of V(G)∪E(G). ...
A vertex cover of a graph G = (V, E) is a subset S ⊆ V such that every edge is incident with at leas...
AbstractLet n be an integer, n ⩾ 2. A set Mn of complete bipartite (di-)graphs with n vertices is ca...
AbstractLet n be an integer, n ⩾ 2. A set Mn of complete bipartite (di-)graphs with n vertices is ca...
A dominating set of a graph G is a set D⊆ VG such that every vertex in VG- D is adjacent to at least...
Suppose we are given a bipartite graph with vertex set X, Y, |X| = n, |Y| = N, each point in X (Y) h...
Consider a graph G with chromatic number k and a collection of complete bipartite graphs, or bicliqu...
A clique covering of a graph G is a set of cliques of G such that any edge of G is contained in one ...
AbstractWe prove the following theorem: the edge set of every graph G on n vertices can be partition...
AbstractThe folloeing problem is investigated. Given an undirected graph G, determine the smallest c...
AbstractWe consider computational problems on covering graphs with bicliques (complete bipartite sub...
Graham and Pollak proved that one needs at least n − 1 complete bipartite sub-graphs (bicliques) to ...
AbstractLet G be a simple graph of order n(G). A vertex set D of G is dominating if every vertex not...
A biclique B of a simple graph G is the edge-set of a complete bipartite subgraph of G. A biclique c...
We consider computational problems on covering graphs with bicliques (complete bipartite subgraphs)....
AbstractA total cover of a graph G is a subset of V(G)∪E(G) which covers all elements of V(G)∪E(G). ...
A vertex cover of a graph G = (V, E) is a subset S ⊆ V such that every edge is incident with at leas...
AbstractLet n be an integer, n ⩾ 2. A set Mn of complete bipartite (di-)graphs with n vertices is ca...
AbstractLet n be an integer, n ⩾ 2. A set Mn of complete bipartite (di-)graphs with n vertices is ca...
A dominating set of a graph G is a set D⊆ VG such that every vertex in VG- D is adjacent to at least...
Suppose we are given a bipartite graph with vertex set X, Y, |X| = n, |Y| = N, each point in X (Y) h...
Consider a graph G with chromatic number k and a collection of complete bipartite graphs, or bicliqu...
A clique covering of a graph G is a set of cliques of G such that any edge of G is contained in one ...
AbstractWe prove the following theorem: the edge set of every graph G on n vertices can be partition...
AbstractThe folloeing problem is investigated. Given an undirected graph G, determine the smallest c...
AbstractWe consider computational problems on covering graphs with bicliques (complete bipartite sub...
Graham and Pollak proved that one needs at least n − 1 complete bipartite sub-graphs (bicliques) to ...
AbstractLet G be a simple graph of order n(G). A vertex set D of G is dominating if every vertex not...
A biclique B of a simple graph G is the edge-set of a complete bipartite subgraph of G. A biclique c...
We consider computational problems on covering graphs with bicliques (complete bipartite subgraphs)....
AbstractA total cover of a graph G is a subset of V(G)∪E(G) which covers all elements of V(G)∪E(G). ...
A vertex cover of a graph G = (V, E) is a subset S ⊆ V such that every edge is incident with at leas...
AbstractLet n be an integer, n ⩾ 2. A set Mn of complete bipartite (di-)graphs with n vertices is ca...
Add to ORKG