On the bipartite density of regular graphs with large girth
From MaRDI portal
Publication:3970895
DOI10.1002/jgt.3190140602zbMath0735.05053OpenAlexW2156211557MaRDI QIDQ3970895
Publication date: 25 June 1992
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190140602
Related Items (4)
Properties of regular graphs with large girth via local algorithms ⋮ New formulae for the bipartite vertex frustration and decycling number of graphs ⋮ High-girth cubic graphs are homomorphic to the Clebsch graph ⋮ Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs
This page was built for publication: On the bipartite density of regular graphs with large girth
