On hereditary subdirectly irreducible graphs
Jiří Vinárek (1984)
Acta Universitatis Carolinae. Mathematica et Physica
Similarity:
Displaying similar documents to “Different types of products and subdirectly irreducible”
On hereditary subdirectly irreducible graphs
On edge-colorability products of graphs.
Mohar, Bojan (1984)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Productive and inductive constructions of graphs
Vinárek, Jiří
Similarity:
Graph equations, graph inequalities and a fixed point theorem.
I.B. Lackovic, D.M. Cvetkovic (1976)
Publications de l'Institut Mathématique [Elektronische Ressource]
Similarity:
Existence and nonexistence of universal graphs
Lawrence Moss (1989)
Fundamenta Mathematicae
Similarity:
Some results on graphs with at most two positive eigenvalues.
Petrović, Miroslav (1991)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
A cancellation property for the direct product of graphs
Richard H. Hammack (2008)
Discussiones Mathematicae Graph Theory
Similarity:
Given graphs A, B and C for which A×C ≅ B×C, it is not generally true that A ≅ B. However, it is known that A×C ≅ B×C implies A ≅ B provided that C is non-bipartite, or that there are homomorphisms from A and B to C. This note proves an additional cancellation property. We show that if B and C are bipartite, then A×C ≅ B×C implies A ≅ B if and only if no component of B admits an involution that interchanges its partite sets.