A High Girth Graph Construction

DOI10.1137/S0895480101387893zbMath1041.68068MaRDI QIDQ4443093

L. Sunil Chandran

Publication date: 8 January 2004

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

algorithmgirth

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10)

Related Items (8)

A branch‐and‐cut algorithm for a bipartite graph construction problem in digital communication systems ⋮ A randomized construction of high girth regular graphs ⋮ Small minors in dense graphs ⋮ Logarithmically small minors and topological minors ⋮ Girth and treewidth ⋮ ON SPANNERS OF GEOMETRIC GRAPHS ⋮ PROPERTY A AND GRAPHS WITH LARGE GIRTH ⋮ Minimum cuts, girth and a spectral threshold

This page was built for publication: A High Girth Graph Construction