AbstractA partial characterization of clique graphs is given here, including a method for constructing a graph having a given graph as its clique graph, provided the given graph meets certain conditions. In addition, an example is presented to show the existence of graphs which are not clique graphs
Isometric subgraphs of hypercubes are known as partial cubes. The subdivision graph of a graph G is ...
AbstractA complete set of a graph G is a subset of vertices inducing a complete subgraph. A clique i...
Abstract. In this paper, we extend the recently introduced concept of partially dual ribbon graphs t...
AbstractA partial characterization of clique graphs is given here, including a method for constructi...
AbstractIn a recent paper [3], Hamelink obtains an interesting sufficient condition for a graph to b...
A complete set of a graph G is a subset of V inducing a complete subgraph. A clique is a maximal com...
AbstractThe clique graph of a graph G is the graph obtained by taking the cliques of G as vertices, ...
AbstractThe clique graph, K(G), of a graph G is the intersection graph of the maximal cliques of G. ...
A graph is a cycle of cliques, if its set of vertices can be partitioned into clusters, such that ea...
The clique graph of a graph G is the graph obtained by taking the cliques of G as vertices, and two ...
AbstractThe clique graph of a graph G is the graph obtained by taking the cliques of G as vertices, ...
The clique graph, K(G), of a graph G is the intersection graph of the maximal cliques of G. For a na...
An edge which belongs to more than one clique of a given graph is called a multicliqual edge. We fin...
AbstractA clique-transversal of a graph G is a subset of vertices that meets all the cliques of G. A...
This thesis examines the devices employed by various algorithms to search for maximal complete subgr...
Isometric subgraphs of hypercubes are known as partial cubes. The subdivision graph of a graph G is ...
AbstractA complete set of a graph G is a subset of vertices inducing a complete subgraph. A clique i...
Abstract. In this paper, we extend the recently introduced concept of partially dual ribbon graphs t...
AbstractA partial characterization of clique graphs is given here, including a method for constructi...
AbstractIn a recent paper [3], Hamelink obtains an interesting sufficient condition for a graph to b...
A complete set of a graph G is a subset of V inducing a complete subgraph. A clique is a maximal com...
AbstractThe clique graph of a graph G is the graph obtained by taking the cliques of G as vertices, ...
AbstractThe clique graph, K(G), of a graph G is the intersection graph of the maximal cliques of G. ...
A graph is a cycle of cliques, if its set of vertices can be partitioned into clusters, such that ea...
The clique graph of a graph G is the graph obtained by taking the cliques of G as vertices, and two ...
AbstractThe clique graph of a graph G is the graph obtained by taking the cliques of G as vertices, ...
The clique graph, K(G), of a graph G is the intersection graph of the maximal cliques of G. For a na...
An edge which belongs to more than one clique of a given graph is called a multicliqual edge. We fin...
AbstractA clique-transversal of a graph G is a subset of vertices that meets all the cliques of G. A...
This thesis examines the devices employed by various algorithms to search for maximal complete subgr...
Isometric subgraphs of hypercubes are known as partial cubes. The subdivision graph of a graph G is ...
AbstractA complete set of a graph G is a subset of vertices inducing a complete subgraph. A clique i...
Abstract. In this paper, we extend the recently introduced concept of partially dual ribbon graphs t...
DOI
Add to ORKG