Graphs of prescribed girth and bi-degree
From MaRDI portal
Publication:1898720
DOI10.1006/JCTB.1995.1033zbMATH Open0828.05034OpenAlexW2051411864MaRDI QIDQ1898720FDOQ1898720
Authors: Felix Lazebnik, V. A. Ustimenko, Zoltán Füredi, Ákos Seress, Andrew J. Woldar
Publication date: 20 September 1995
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1995.1033
Recommendations
Cited In (17)
- On a relation between bipartite biregular cages, block designs and generalized polygons
- A new series of dense graphs of high girth
- Generalized cages
- Network coding in undirected graphs is either very helpful or not helpful at all
- On the conjecture for the girth of the bipartite graph \(D(k,q)\)
- Linear programming based approximation for unweighted induced matchings -- breaking the \(\varDelta\) barrier
- On the girth of the bipartite graph \(D(k, q)\)
- Keyed hash function from large girth expander graphs
- Girth of the algebraic bipartite graph \(D(k,q)\)
- On the homogeneous algebraic graphs of large girth and their applications
- A simple proof for the lower bound of the girth of graphs \(D(n,q)\)
- Extremal properties of regular and affine generalized \(m\)-gons as tactical configurations
- A characterization of the components of the graphs \(D(k,q)\)
- On the girth cycles of the bipartite graph \(D(k, q)\)
- New results on bipartite biregular cages, block designs, and generalized polygons
- On biregular bipartite graphs of small excess
- General properties of some families of graphs defined by systems of equations
This page was built for publication: Graphs of prescribed girth and bi-degree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1898720)