Degree conditions and degree bounded trees

DOI10.1016/J.DISC.2007.12.099zbMath1226.05090OpenAlexW2171375573MaRDI QIDQ1025562

Hajime Matsumura, Haruhide Matsuda

Publication date: 19 June 2009

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.099

zbMATH Keywords

treespanning treedegree bounded treedegree sum condition

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07)

Related Items (2)

A \(k\)-tree containing specified vertices ⋮ On a spanning \(k\)-tree in which specified vertices have degree less than \(k\)

Cites Work

• Unnamed Item
• Cycles through specified vertices
• Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
• Cycles through subsets with large degree sums
• Cycles through given vertices and closures
• Cycles through prescribed vertices with large degree sum
• Note on Hamilton Circuits
• 2‐neighborhoods and hamiltonian conditions
• Sequences, claws and cyclability of graphs

This page was built for publication: Degree conditions and degree bounded trees