Leafy spanning trees in hypercubes
From MaRDI portal
Recommendations
Cites work
- A short note on the approximability of the maximum leaves spanning tree problem
- Approximating Maximum Leaf Spanning Trees in Almost Linear Time
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1305098 (Why is no real title available?)
- scientific article; zbMATH DE number 3318360 (Why is no real title available?)
- Independent domination in hypercubes
- Spanning Trees with Many Leaves
Cited in
(10)- The starlike trees which span a hypercube
- Spanning subgraphs of a hypercube. IV: Rooted trees
- Spanning trees on hypercubic lattices and nonorientable surfaces
- Connectivity and edge-bipancyclicity of Hamming shell
- Regular connected bipancyclic spanning subgraphs of hypercubes
- Spanning Trees and Domination in Hypercubes
- Regular connected bipancyclic spanning subgraphs of torus networks
- Spanning trees and domination in hypercubes
- Leafy spanning arborescences in DAGs
- Leafy spanning arborescences in DAGs
This page was built for publication: Leafy spanning trees in hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5950587)