Completely independent spanning trees in \(k\)-th power of graphs
type: Item
instance of: scholarly article
title: Completely independent spanning trees in \(k\)-th power of graphs
zbMATH Open document ID: 1391.05080
author: Xia Hong
publication date: 2018-06-29T00:00:00Z
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 6897681
zbMATH Keywords: completely independent spanning tree
zbMATH Keywords: power of graphs
zbMATH Keywords: spanning trees
MaRDI profile type: Publication
full work available at URL: dmgt.2038
OpenAlex ID: W2792506579
cites work: Dirac's Condition for Completely Independent Spanning Trees
cites work: Homeomorphically irreducible spanning trees
cites work: Ore's condition for completely independent spanning trees
cites work: Completely independent spanning trees in the underlying graph of a line digraph
cites work: Q4414501
cites work: Degree condition for completely independent spanning trees
cites work: Edge-Disjoint Spanning Trees of Finite Graphs
cites work: Two counterexamples on completely independent spanning trees
cites work: On the Problem of Decomposing a Graph into n Connected Factors
DOI: 10.7151/DMGT.2038
published in: Discussiones Mathematicae Graph Theory
description: scientific article; zbMATH DE number 6897681