On non-separating embeddings of graphs in closed surfaces.
Škoviera, M. (1992)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Displaying similar documents to “A note on a Moore bound for graphs embedded in surfaces.”
On non-separating embeddings of graphs in closed surfaces.
Face-width of embedded graphs
Bojan Mohar (1997)
Mathematica Slovaca
Similarity:
A Kotzig type theorem for non-orientable surfaces
Stanislav Jendroľ, Milan Tuhársky (2006)
Mathematica Slovaca
Similarity:
Diagonalizable embedding of composition graphs
Mohammed Z. Abu-Sbeih (1999)
Mathematica Slovaca
Similarity:
Cospectral Graphs With Least Eigenvalue at Least -2
Dragoš Cvetković, Mirko Lepović (2005)
Publications de l'Institut Mathématique
Similarity:
Counterexamples for properties of line graphs of graphs of diameter two
Harishchandra S. Ramane, Ivan Gutman (2010)
Kragujevac Journal of Mathematics
Similarity:
The Thickness of Amalgamations and Cartesian Product of Graphs
Yan Yang, Yichao Chen (2017)
Discussiones Mathematicae Graph Theory
Similarity:
The thickness of a graph is the minimum number of planar spanning subgraphs into which the graph can be decomposed. It is a measurement of the closeness to the planarity of a graph, and it also has important applications to VLSI design, but it has been known for only few graphs. We obtain the thickness of vertex-amalgamation and bar-amalgamation of graphs, the lower and upper bounds for the thickness of edge-amalgamation and 2-vertex-amalgamation of graphs, respectively. We also study...