Graphs with constant link and small degree or order
From MaRDI portal
Publication:3705490
Recommendations
Cited in
(19)- On minimal neighbourhood-connected graphs
- Locally \(K_{3,3}\) or Petersen graphs
- Covering projections of graphs preserving links of vertices and edges
- Locally grid graphs: Classification and Tutte uniqueness
- On (1, 2)-realizable graphs
- Variations on a theme by Weetman
- Degrees in link graphs of regular graphs
- On self-clique shoal graphs
- Graphs which are linked structures
- scientific article; zbMATH DE number 3972885 (Why is no real title available?)
- scientific article; zbMATH DE number 4110715 (Why is no real title available?)
- scientific article; zbMATH DE number 32741 (Why is no real title available?)
- scientific article; zbMATH DE number 64359 (Why is no real title available?)
- A polynomial time algorithm recognizing link trees
- An infinite family of incidence geometries whose incidence graphs are locally \(X^\ast\)
- The local recognition of reflection graphs of spherical Coxeter groups
- Flip colouring of graphs
- Some locally Kneser graphs
- Local recognition of the point graphs of some Lie incidence geometries
This page was built for publication: Graphs with constant link and small degree or order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3705490)