A note on spanning trees with a specified degree sequence

DOI10.1007/S40590-019-00250-6MaRDI QIDQ2188994zbMATH OpenOpenAlexFDO

Authors María Elena Martínez-Cuero, E. Rivera-Campo

Publication date 15 June 2020

Published in Boletín de la Sociedad Matemática Mexicana. Third Series (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1812.08659

zbMATH Keywords

degree sequencespanning treearboreal

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07)

Abstract: We give an Ore-Type condition sufficient for a graph G to have a spanning tree with a specified degree sequence.

Cites work

• Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
• Graph theory with applications
• Independence trees and Hamilton cycles
• Note on Hamilton Circuits
• Spanning trees with small degrees and few leaves

Cited in

(5)

• A note on matchings and spanning trees with bounded degrees
• Degree sequences and graphs with disjoint spanning trees
• A note on spanning with options
• A note on total excess of spanning trees
• Sequences of spanning trees and a fixed tree theorem

This page was built for publication: A note on spanning trees with a specified degree sequence

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