Pages that link to "Item:Q264582"
From MaRDI portal
The following pages link to Complexity of the maximum leaf spanning tree problem on planar and regular graphs (Q264582):
Displayed 6 items.
- Optimization of wireless sensor networks deployment with coverage and connectivity constraints (Q829179) (← links)
- Invulnerability of planar two-tree networks (Q1733045) (← links)
- Connected domination in maximal outerplanar graphs (Q2192107) (← links)
- A method to calculate the number of spanning connected unicyclic(bicyclic) subgraphs in 2-separable networks (Q2672618) (← links)
- Connected Domination (Q3384607) (← links)
- The complexity of spanning tree problems involving graphical indices (Q6202942) (← links)