Quadrilateral embeddings of the conjunction of graphs
Vladimír Železník (1988)
Mathematica Slovaca
Similarity:
Vladimír Železník (1988)
Mathematica Slovaca
Similarity:
Plummer, Michael D., Zha, Xiaoya (2002)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Siniša T. Vrećica (2011)
The Teaching of Mathematics
Similarity:
Zaslavsky, Thomas (1998)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Neel, David L., Orrison, Michael E. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Little, C., Vince, A. (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Vladimir D. Samodivkin (2013)
Czechoslovak Mathematical Journal
Similarity:
For a graph property and a graph , we define the domination subdivision number with respect to the property to be the minimum number of edges that must be subdivided (where each edge in can be subdivided at most once) in order to change the domination number with respect to the property . In this paper we obtain upper bounds in terms of maximum degree and orientable/non-orientable genus for the domination subdivision number with respect to an induced-hereditary property, total...