Pages that link to "Item:Q3970895"
From MaRDI portal
The following pages link to On the bipartite density of regular graphs with large girth (Q3970895):
Displaying 4 items.
- Properties of regular graphs with large girth via local algorithms (Q326821) (← links)
- New formulae for the bipartite vertex frustration and decycling number of graphs (Q2008493) (← links)
- High-girth cubic graphs are homomorphic to the Clebsch graph (Q3083411) (← links)
- Maximum edge-cuts in cubic graphs with large girth and in random cubic graphs (Q3145840) (← links)
