Groups and Monoids of Regular Graphs (And of Graphs with Bounded Degrees)

DOI10.4153/CJM-1973-024-8MaRDI QIDQ5666582zbMATH OpenFDO

Authors J. Nešetřil, Pavol Hell

Publication date 1973

Published in Canadian Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.4153/CJM-1973-024-8

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Finite automorphism groups of algebraic, geometric, or combinatorial structures (20B25)

Cited in

(10)

• A surprising permanence of old motivations (a not-so-rigid story)
• Covering regular graphs
• Towards a characterization of universal categories
• Universal partial order represented by means of oriented trees and other simple graphs
• Finite paths are universal
• Finite paths are universal
• Generating transformation semigroups using endomorphisms of preorders, graphs, and tolerances.
• The core of a graph
• On endomorphism universality of sparse graph classes
• Computing automorphisms of semigroups.

This page was built for publication: Groups and Monoids of Regular Graphs (And of Graphs with Bounded Degrees)

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