AbstractWe prove that a locally cobipartite graph on n vertices contains a family of at most n cliques that cover its edges. This is related to Opsut's conjecture that states the competition number of a locally cobipartite graph is at most two
AbstractCliques are complete subgraphs of a graph. In this note we show that minimum sets of maximal...
AbstractSeveral new tools are presented for determining the number of cliques needed to (edge-)parti...
AbstractLet c(G) denote the minimum number of cliques necessary to cover all edges of a graph G. A c...
AbstractWe prove that a locally cobipartite graph on n vertices contains a family of at most n cliqu...
AbstractThe notion of the competition hypergraph was introduced as a variant of the notion of the co...
AbstractThe notion of the competition hypergraph was introduced as a variant of the notion of the co...
A k−clique covering of a simple graph G, is an edge covering of G by its cliques such that each vert...
The competition graph of an acyclic directed graph D is the undirected graph on the same vertex set ...
AbstractA clique in a graph G is a complete subgraph of G. A clique covering (partition) of G is a c...
AbstractSeveral new tools are presented for determining the number of cliques needed to (edge-)parti...
An edge clique cover of a graph is a set of cliques that covers all edges of the graph. We generaliz...
A clique covering of a graph G is a set of cliques of G such that any edge of G is contained in one ...
Abstract In this paper, we show that for any simple, bridgeless graph G on n vertices, there is a fa...
AbstractLet T2n be the complement of a perfect matching in the complete graph on 2n vertices, and cc...
Abstract. IfD (V, A) is a digraph, its p-competition graph forp a positive integer has vertex set Va...
AbstractCliques are complete subgraphs of a graph. In this note we show that minimum sets of maximal...
AbstractSeveral new tools are presented for determining the number of cliques needed to (edge-)parti...
AbstractLet c(G) denote the minimum number of cliques necessary to cover all edges of a graph G. A c...
AbstractWe prove that a locally cobipartite graph on n vertices contains a family of at most n cliqu...
AbstractThe notion of the competition hypergraph was introduced as a variant of the notion of the co...
AbstractThe notion of the competition hypergraph was introduced as a variant of the notion of the co...
A k−clique covering of a simple graph G, is an edge covering of G by its cliques such that each vert...
The competition graph of an acyclic directed graph D is the undirected graph on the same vertex set ...
AbstractA clique in a graph G is a complete subgraph of G. A clique covering (partition) of G is a c...
AbstractSeveral new tools are presented for determining the number of cliques needed to (edge-)parti...
An edge clique cover of a graph is a set of cliques that covers all edges of the graph. We generaliz...
A clique covering of a graph G is a set of cliques of G such that any edge of G is contained in one ...
Abstract In this paper, we show that for any simple, bridgeless graph G on n vertices, there is a fa...
AbstractLet T2n be the complement of a perfect matching in the complete graph on 2n vertices, and cc...
Abstract. IfD (V, A) is a digraph, its p-competition graph forp a positive integer has vertex set Va...
AbstractCliques are complete subgraphs of a graph. In this note we show that minimum sets of maximal...
AbstractSeveral new tools are presented for determining the number of cliques needed to (edge-)parti...
AbstractLet c(G) denote the minimum number of cliques necessary to cover all edges of a graph G. A c...
DOI
Add to ORKG