On the Edge-sets of Rigid and Corigid Graphs

DOI10.1002/mana.19790870108zbMath0424.05034OpenAlexW2131054238MaRDI QIDQ3858298

Jaroslav Nešetřil, Pavol Hell

Publication date: 1979

Published in: Mathematische Nachrichten (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/mana.19790870108

zbMATH Keywords

endomorphismidentityrigid graph

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items (2)

Unnamed Item ⋮ A surprising permanence of old motivations (a not-so-rigid story)

Cites Work

• The number of homeomorphically irreducible trees, and other species
• On Rigid Undirected Graphs

This page was built for publication: On the Edge-sets of Rigid and Corigid Graphs