EUDML | Remarks on diagonalizable embeddings of graphs

Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')

Displaying similar documents to “Remarks on diagonalizable embeddings of graphs”

Diagonalizable embedding of composition graphs

Mohammed Z. Abu-Sbeih (1999)

Mathematica Slovaca

Similarity:

Quadrilateral embeddings of the conjunction of graphs

Vladimír Železník (1988)

Mathematica Slovaca

Similarity:

Planarizing graphs---a survey and annotated bibliography.

Liebers, Annegret (2001)

Journal of Graph Algorithms and Applications

Similarity:

Fixed-point-free embeddings of graphs in their complements.

Schuster, Seymour (1978)

International Journal of Mathematics and Mathematical Sciences

Similarity:

Bipartite graphs that are not circle graphs

André Bouchet (1999)

Annales de l'institut Fourier

Similarity:

The following result is proved: if a bipartite graph is not a circle graph, then its complement is not a circle graph. The proof uses Naji’s characterization of circle graphs by means of a linear system of equations with unknowns in $GF (2)$ . At the end of this short note I briefly recall the work of François Jaeger on circle graphs.