[HTML][HTML] Diagonalized Cartesian products of S-prime graphs are S-prime
M Hellmuth, L Ostermeier, PF Stadler - Discrete mathematics, 2012 - Elsevier
A graph is said to be S-prime if, whenever it is a subgraph of a nontrivial Cartesian product
graph, it is a subgraph of one of the factors. A diagonalized Cartesian product is obtained
from a Cartesian product graph by connecting two vertices of maximal distance by an
additional edge. We show there that a diagonalized product of S-prime graphs is again S-
prime. Klavžar et al.[S. Klavžar, A. Lipovec, M. Petkovšek, On subgraphs of Cartesian
product graphs, Discrete Math. 244 (2002) 223–230] proved that a graph is S-prime if and …
graph, it is a subgraph of one of the factors. A diagonalized Cartesian product is obtained
from a Cartesian product graph by connecting two vertices of maximal distance by an
additional edge. We show there that a diagonalized product of S-prime graphs is again S-
prime. Klavžar et al.[S. Klavžar, A. Lipovec, M. Petkovšek, On subgraphs of Cartesian
product graphs, Discrete Math. 244 (2002) 223–230] proved that a graph is S-prime if and …
[CITATION][C] Diagonalized Cartesian products of S-prime graphs are S-prime. 2009. Submitted to
M Hellmuth, L Gringmann, PF Stadler - Discrete Mathematics
Showing the best results for this search. See all results