Embedding m-quasistars into n-cubes

DOI10.21136/CMJ.1988.102266MaRDI QIDQ3832587zbMATH OpenOpenAlexFDO

Authors Ladislav Nebeský

Publication date 1988

Full work available at URL https://eudml.org/doc/13744

zbMATH Keywords

balanced m-quasistarsn-cube

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Recommendations

• On quasistars in n-cubes
• Disjoint cycles and spanning graphs of hypercubes
• On embedding of certain recursive trees and stars into hypercube
• Optimal embeddings of generalized ladders into hypercubes
• Embedding double starlike trees into hypercubes

Cites work

• scientific article; zbMATH DE number 3625415 (Why is no real title available?)
• On Hamiltonian circuits and spanning trees of hypercubes
• On quasistars in n-cubes

Cited in

(8)

• Fault-tolerant embedding of starlike trees into restricted hypercube-like graphs
• Spanning multi-paths in hypercubes
• Disjoint path covers with path length constraints in restricted hypercube-like graphs
• Algorithms for finding disjoint path covers in unit interval graphs
• On quasistars in n-cubes
• Embedding a subclass of trees into hypercubes
• A counter-example to a lemma about embedding starlike trees into hypercube
• Disjoint cycles and spanning graphs of hypercubes

This page was built for publication: Embedding $m$-quasistars into $n$-cubes

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