Existential closure in line graphs
From MaRDI portal
Recommendations
Cites work
- Characterizations of derived graphs
- Convex Polyhedra with Regular Faces
- Diameter bounds for planar graphs
- Die Formen der Vielflache.
- Existential closure of block intersection graphs of infinite designs having finite block size and index
- Existential closure of block intersection graphs of infinite designs having infinite block size
- Existentially closed BIBD block-intersection graphs
- Fast generation of planar graphs
- Graphs which contain all small graphs
- scientific article; zbMATH DE number 1232919 (Why is no real title available?)
- Large planar graphs with given diameter and maximum degree
- Largest planar graphs of diameter two and fixed maximum degree
- On an adjacency property of almost all graphs
- Paley graphs satisfy all first-order adjacency axioms
- Steiner triple systems and existentially closed graphs
- The search for N-e.c. Graphs
- Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs
- Über eine Eigenschaft der ebenen Komplexe.
This page was built for publication: Existential closure in line graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6616441)