equal
deleted
inserted
replaced
583 E_2\f$ |
583 E_2\f$ |
584 |
584 |
585 In addition, the graph nodes may be \e labeled, i.e. we are given two |
585 In addition, the graph nodes may be \e labeled, i.e. we are given two |
586 node labelings \f$l_1:V_1\longrightarrow L\f$ and \f$l_2:V_2\longrightarrow |
586 node labelings \f$l_1:V_1\longrightarrow L\f$ and \f$l_2:V_2\longrightarrow |
587 L\f$ and we require that \f$l_1(u)=l_2(f(u))\f$ holds for all nodes \f$u \in |
587 L\f$ and we require that \f$l_1(u)=l_2(f(u))\f$ holds for all nodes \f$u \in |
588 G\f$. |
588 G_1\f$. |
589 |
589 |
590 */ |
590 */ |
591 |
591 |
592 /** |
592 /** |
593 @defgroup planar Planar Embedding and Drawing |
593 @defgroup planar Planar Embedding and Drawing |