A spanning tree of the 2^ m-dimensional hypercube with maximum number of degree-preserving vertices

DOI10.1016/0012-365X(93)90343-RzbMATH Open0783.05039MaRDI QIDQ686181FDOQ686181

Puhua Guan, Sul-young Choi

Publication date: 10 March 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

treespanning tree\(n\)-dimensional hypercubedegree-preserving vertex

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Cites Work

• The starlike trees which span a hypercube
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (1)

• Spanning trees: A survey

   Recommendations

• Spanning graphs of hypercubes: Starlike and double starlike trees 👍 👎
• Title not available (Why is that?) 👍 👎
• Spanning subgraphs of a hypercube. IV: Rooted trees 👍 👎
• On Hamiltonian circuits and spanning trees of hypercubes 👍 👎
• On induced subgraphs of the cube 👍 👎

This page was built for publication: A spanning tree of the \(2^ m\)-dimensional hypercube with maximum number of degree-preserving vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686181)