Pages that link to "Item:Q1894370"
From MaRDI portal
The following pages link to Explicit construction of graphs with an arbitrary large girth and of large size (Q1894370):
Displaying 15 items.
- Keyed hash function from large girth expander graphs (Q5086121) (← links)
- Graphs with few paths of prescribed length between any two vertices (Q5110588) (← links)
- Obstructions for Three-Coloring and List Three-Coloring $H$-Free Graphs (Q5216779) (← links)
- Recent Developments in Low-Density Parity-Check Codes (Q5323003) (← links)
- A Bound on the Number of Edges in Graphs Without an Even Cycle (Q5366930) (← links)
- LDPC Codes Based on Algebraic Graphs (Q5406683) (← links)
- On the key exchange and multivariate encryption with nonlinear polynomial maps of stable degree (Q5500394) (← links)
- Girth of the algebraic bipartite graph \(D(k,q)\) (Q6063247) (← links)
- A simple proof for the lower bound of the girth of graphs \(D(n,q)\) (Q6080170) (← links)
- On the girth cycles of the bipartite graph \(D(k, q)\) (Q6098087) (← links)
- On the eigenvalues of the graphs \(D(5,q)\) (Q6144456) (← links)
- Digraph redicolouring (Q6146501) (← links)
- Extremal numbers of hypergraph suspensions of even cycles (Q6201917) (← links)
- Flip colouring of graphs (Q6632145) (← links)
- A polynomial resultant approach to algebraic constructions of extremal graphs (Q6668587) (← links)
