A toughness condition for a spanning tree with bounded total excesses
type: Item
instance of: scholarly article
title: A toughness condition for a spanning tree with bounded total excesses
zbMATH Open document ID: 1321.05048
author: Kenta Ozeki
published in: Graphs and Combinatorics
publication date: 2015-09-24T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C38
zbMATH DE Number: 6484836
zbMATH Keywords: spanning \(k\)-trees
zbMATH Keywords: toughness
zbMATH Keywords: total excess
MaRDI profile type: Publication
full work available at URL: s00373-014-1487-0
OpenAlex ID: W2000679221
cites work: Toughness in graphs -- a survey
cites work: Planar graphs without adjacent cycles of length at most seven are 3-colorable
cites work: Tough graphs and Hamiltonian circuits.
cites work: Connected \((g,f)\)-factors
cites work: Toughness, trees, and walks
cites work: Q4649987
cites work: On a connection between the existence of k-trees and the toughness of a graph
DOI: 10.1007/S00373-014-1487-0
description: scientific article; zbMATH DE number 6484836