On Rigid Undirected Graphs

DOI10.4153/CJM-1966-121-7MaRDI QIDQ5522043zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

topology

Cited in

(17)

• Homomorphisms of derivative graphs
• Almost all graphs are rigid-revisited
• Endomorphisms of graphs. II: Various unretractive graphs
• Every finite graph is a full subgraph of a rigid graph
• On the Edge-sets of Rigid and Corigid Graphs
• Asymmetric trees with two prescribed degrees
• Homomorphisms and Endomorphisms in Varieties of Pseudocomplemented Distributive Lattices (with Applications to Heyting Algebras)
• The endomorphism spectrum of an ordered set
• Homomorphically full graphs
• Endomorphism spectra of graphs
• Universal varieties of distributive double p-algebras
• Semigroups of mappings on graphs
• A surprising permanence of old motivations (a not-so-rigid story)
• Unretractive and S-unretractive joins and lexicographic products of graphs
• Cohomomorphisms of graphs and hypergraphs
• Quotients of rigid (0,1)-lattices
• Endomorphisms of graphs. I: The monoid of strong endomorphisms

This page was built for publication: On Rigid Undirected Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5522043)