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 11 items.
- Properties of regular graphs with large girth via local algorithms (Q326821) (← links)
- On bipartite graphs with weak density of some subgraphs (Q878650) (← links)
- Bipartite density of triangle-free subcubic graphs (Q1028464) (← links)
- The size of bipartite graphs with a given girth (Q1403918) (← links)
- Bipartite density of cubic graphs: The case of equality (Q1827798) (← links)
- Bipartite density of cubic graphs (Q1861239) (← links)
- New formulae for the bipartite vertex frustration and decycling number of graphs (Q2008493) (← links)
- On biregular bipartite graphs of small excess (Q2421873) (← 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)
- A note on bipartite subgraphs of triangle-free regular graphs (Q3356324) (← links)