Crossing numbers and cutwidths.
Djidjev, Hristo N., Vrt'o, Imrich (2003)
Journal of Graph Algorithms and Applications
Similarity:
Displaying similar documents to “The Fibonacci dimension of a graph.”
Crossing numbers and cutwidths.
Planarizing graphs---a survey and annotated bibliography.
Liebers, Annegret (2001)
Journal of Graph Algorithms and Applications
Similarity:
Quadrilateral embeddings of the conjunction of graphs
Vladimír Železník (1988)
Mathematica Slovaca
Similarity:
Even circuits of prescribed clockwise parity.
Fischer, Ilse, Little, C.H.C. (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A survey of the algorithmic properties of simplicial, upper bound and middle graphs.
Cheston, Grant A., Jap, Tjoen Seng (2006)
Journal of Graph Algorithms and Applications
Similarity:
Vector spaces and the Petersen graph.
de Carvalho, Marcelo H., Little, C.H.C. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The cube polynomial and its derivatives: The case of median graphs.
Brešar, Boštjan, Klavžar, Sandi, Škrekovski, Riste (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Parity versions of 2-connectedness.
Little, C., Vince, A. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Distinct distances in graph drawings.
Carmi, Paz, Dujmovic, Vida, Morin, Pat, Wood, David R. (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Hamiltonicity of -traceable graphs.
Bullock, Frank, Dankelmann, Peter, Frick, Marietjie, Henning, Michael A., Oellermann, Ortrud R., van Aardt, Susan (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity: