Explicit construction of regular graphs without small cycles
From MaRDI portal
Publication:790830
DOI10.1007/BF02579157zbMATH Open0535.05033MaRDI QIDQ790830FDOQ790830
Authors: Wilfried Imrich
Publication date: 1984
Published in: Combinatorica (Search for Journal in Brave)
Recommendations
Cites Work
Cited In (24)
- Weak degeneracy of graphs
- Triples and hexagons
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems
- A new series of dense graphs of high girth
- Low-distortion embeddings of graphs with large girth
- On the girth of infinite graphs
- Regular graphs with no homomorphisms onto cycles
- Cops and robbers in graphs with large girth and Cayley graphs
- Ramanujan graphs
- Keyed hash function from large girth expander graphs
- Colouring graphs with forbidden bipartite subgraphs
- On the girth of random Cayley graphs
- On a pursuit game on Cayley graphs
- Exponentially many perfect matchings in cubic graphs
- New examples of graphs without small cycles and of large size
- Conformal growth rates and spectral geometry on distributional limits of graphs
- On the homogeneous algebraic graphs of large girth and their applications
- Title not available (Why is that?)
- The second eigenvalue of regular graphs of given girth
- Explicit construction of graphs with an arbitrary large girth and of large size
- Regular graphs of large girth and arbitrary degree
- Turán problems for integer-weighted graphs
- Cayley type graphs and cubic graphs of large girth
- Kissing numbers of regular graphs
This page was built for publication: Explicit construction of regular graphs without small cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q790830)