Validity up to complementation in graph theory
T. McKee (1983)
Fundamenta Mathematicae
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
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 further glance at classifiable 1-ary functions”
Validity up to complementation in graph theory
Classes of graphs with restricted interval models.
Proskurowski, Andrzej, Telle, Jan Arne (1999)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Chromatic number of products of graphs
Vladimír Puš (1988)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
-Ramsey classes and dimensions of graphs
Jan Kratochvíl (1995)
Commentationes Mathematicae Universitatis Carolinae
Similarity:
In this note, we introduce the notion of -Ramsey classes of graphs and we reveal connections to intersection dimensions of graphs.
Isomorphic components of Kronecker product of bipartite graphs
Pranava K. Jha, Sandi Klavžar, Blaž Zmazek (1997)
Discussiones Mathematicae Graph Theory
Similarity:
Weichsel (Proc. Amer. Math. Soc. 13 (1962) 47-52) proved that the Kronecker product of two connected bipartite graphs consists of two connected components. A condition on the factor graphs is presented which ensures that such components are isomorphic. It is demonstrated that several familiar and easily constructible graphs are amenable to that condition. A partial converse is proved for the above condition and it is conjectured that the converse is true in general.