Pages that link to "Item:Q5067427"
From MaRDI portal
The following pages link to Bounding the Number of Edges of Matchstick Graphs (Q5067427):
Displaying 5 items.
- Leray numbers of complexes of graphs with bounded matching number (Q2120834) (← links)
- The number of small-degree vertices in matchstick graphs (Q5060444) (← links)
- On the maximum number of edges in chordal graphs of bounded degree and matching number (Q5970781) (← links)
- A tight bound for the number of edges of matchstick graphs (Q6642298) (← links)
- General penny graphs are at most \(\frac{43}{18}\)-dense (Q6671403) (← links)