Pages that link to "Item:Q2550402"
From MaRDI portal
The following pages link to Every finite graph is a full subgraph of a rigid graph (Q2550402):
Displaying 11 items.
- Homomorphisms of unary algebras with a given quotient (Q804614) (← links)
- A surprising permanence of old motivations (a not-so-rigid story) (Q1045032) (← links)
- Gruppenuniversalität und Homogenisierbarkeit (Q1073014) (← links)
- Chromatically optimal rigid graphs (Q1123199) (← links)
- Endomorphism monoids and topological subgraphs of graphs (Q1141150) (← links)
- Quotients of rigid graphs (Q1158448) (← links)
- On some strongly rigid families of graphs and the full embeddings they induce (Q1214943) (← links)
- On the order of countable graphs (Q1404996) (← links)
- Full embeddings into some categories of graphs (Q2559488) (← links)
- Asymmetric trees with two prescribed degrees (Q4111599) (← links)
- Automorphism group and category of cospectral graphs (Q4156799) (← links)