Title of article :
An algorithm for 1-bend embeddings of planar graphs in the two-dimensional grid
Author/Authors :
Morgana، نويسنده , , Aurora and de Mello، نويسنده , , Célia Picinin and Sontacchi، نويسنده , , Giovanna، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2001
Abstract :
The clique graph K(G) of a graph G is the intersection graph of the cliques of G. If G ≌ K(G) then G is a self-clique graph. We describe a sufficient condition for a graph to be self-clique.
Keywords :
planar embedding , Bend , Graph algorithm , GRID
Journal title :
Electronic Notes in Discrete Mathematics
Journal title :
Electronic Notes in Discrete Mathematics
