Spanning \(k\)-trees of \(n\)-connected graphs
type: Item
instance of: scholarly article
title: Spanning \(k\)-trees of \(n\)-connected graphs
zbMATH Open document ID: 1235.05032
author: Mikio Kano
author: Hiroo Kishimoto
published in: Graphs and Combinatorics
publication date: 2012-01-24T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 5999844
zbMATH Keywords: spanning tree
zbMATH Keywords: closure for \(k\)-tree
zbMATH Keywords: spanning \(k\)-tree
zbMATH Keywords: \(n\)-connected graphs
MaRDI profile type: Publication
full work available at URL: s00373-011-1021-6
OpenAlex ID: W2075810525
cites work: A method in graph theory
cites work: Independence trees and Hamilton cycles
cites work: Spanning trees of bounded degree
cites work: On a \(k\)-tree containing specified leaves in a graph
cites work: Spanning trees with bounded degrees
cites work: Note on Hamilton Circuits
cites work: Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
DOI: 10.1007/S00373-011-1021-6
description: scientific article; zbMATH DE number 5999844