The following pages link to (Q3322145):
Displayed 13 items.
- Characterization of minimum cycle basis in weighted partial 2-trees (Q491600) (← links)
- Steiner problem in Halin networks (Q1092013) (← links)
- Parallel O(log n) time edge-colouring of trees and Halin graphs (Q1107328) (← links)
- The binding number of Halin graphs (Q1123910) (← links)
- Edge version of metric dimension and doubly resolving sets of the necklace graph (Q1634709) (← links)
- Small universal point sets for \(k\)-outerplanar graphs (Q1991093) (← links)
- Intersections and circuits in sets of line segments (Q2084612) (← links)
- On minimum average stretch spanning trees in polygonal 2-trees (Q2339451) (← links)
- Listing all spanning trees in Halin graphs — sequential and Parallel view (Q4603872) (← links)
- Edge version of metric dimension for the families of grid graphs and generalized prism graphs (Q4965906) (← links)
- Drawing Halin-graphs with small height (Q5050008) (← links)
- Maximizing the signless Laplacian spectral radius of minimally 3-connected graphs with given size (Q6069165) (← links)
- Removable edges in Halin graphs (Q6130202) (← links)