On Rigid Undirected Graphs
From MaRDI portal
Publication:5522043
DOI10.4153/CJM-1966-121-7zbMath0145.20603OpenAlexW2332349270MaRDI QIDQ5522043
No author found.
Publication date: 1966
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cjm-1966-121-7
Related Items (17)
Homomorphically full graphs ⋮ The endomorphism spectrum of an ordered set ⋮ Homomorphisms and Endomorphisms in Varieties of Pseudocomplemented Distributive Lattices (with Applications to Heyting Algebras) ⋮ Unretractive and S-unretractive joins and lexicographic products of graphs ⋮ Endomorphism spectra of graphs ⋮ Asymmetric trees with two prescribed degrees ⋮ On the Edge-sets of Rigid and Corigid Graphs ⋮ Semigroups of mappings on graphs ⋮ Cohomomorphisms of graphs and hypergraphs ⋮ Homomorphisms of derivative graphs ⋮ Every finite graph is a full subgraph of a rigid graph ⋮ Endomorphisms of graphs. I: The monoid of strong endomorphisms ⋮ Endomorphisms of graphs. II: Various unretractive graphs ⋮ Almost all graphs are rigid-revisited ⋮ A surprising permanence of old motivations (a not-so-rigid story) ⋮ Quotients of rigid (0,1)-lattices ⋮ Universal varieties of distributive double p-algebras
This page was built for publication: On Rigid Undirected Graphs
