On completely independent spanning trees in powers of graphs

MaRDI QIDQ4645574zbMATH OpenFDO

Authors Xia Hong

Publication date 10 January 2019

zbMATH Keywords

power of graphscompletely independent spanning tree

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• Completely independent spanning trees in k-th power of graphs
• Degree condition for completely independent spanning trees
• Completely independent spanning trees in some regular graphs
• scientific article; zbMATH DE number 1953097
• Completely independent spanning trees in torus networks

Cited in

(10)

• Completely independent spanning trees in some regular graphs
• Minimum Degree Conditions and Optimal Graphs for Completely Independent Spanning Trees
• Completely independent spanning trees in the underlying graph of a line digraph
• Completely independent spanning trees in k-th power of graphs
• Completely independent spanning trees in torus networks
• Two counterexamples on completely independent spanning trees
• Degree condition for completely independent spanning trees
• Dirac's condition for completely independent spanning trees
• Almost disjoint spanning trees: relaxing the conditions for completely independent spanning trees
• Fourier analysis and large independent sets in powers of complete graphs

This page was built for publication: On completely independent spanning trees in powers of graphs

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