A note on matchings and spanning trees with bounded degrees

DOI10.1007/BF03352993zbMath0879.05062OpenAlexW2032442730MaRDI QIDQ1359373

Eduardo Rivera-Campo

Publication date: 3 July 1997

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03352993

zbMATH Keywords

independence numberspanning treeperfect matching

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Spanning trees and spanning closed walks with small degrees ⋮ Spanning trees: A survey

Cites Work

• Spanning trees with bounded degrees
• A note on Hamiltonian circuits
• Unnamed Item

This page was built for publication: A note on matchings and spanning trees with bounded degrees