A note on a spanning ( , )-ended tree in a bipartite graph

DOI10.1007/S00373-018-1906-8zbMATH Open1395.05039OpenAlexW2804426631MaRDI QIDQ2413635FDOQ2413635

Authors: Masao Tsugaki 

Publication date: 14 September 2018

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

Full work available at URL: https://doi.org/10.1007/s00373-018-1906-8

Recommendations

• Spanning \(k\)-ended trees of bipartite graphs
• On a spanning tree with specified leaves in a bipartite graph
• Spanning \(k\)-trees of bipartite graphs
• Spanning trees with bounded degrees and leaves
• Degree conditions for graphs to have spanning trees with few branch vertices and leaves

zbMATH Keywords

bipartite graphspanning tree\(k\)-ended treedegree sum condition

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07)

Cites Work

• Spanning \(k\)-ended trees of bipartite graphs
• Independence trees and Hamilton cycles
• Title not available (Why is that?)
• Hamilton connected graphs
• Degree sum conditions for path-factors with specified end vertices in bipartite graphs

Cited In (4)

• Spanning \(k\)-ended trees of bipartite graphs
• On a spanning tree with specified leaves in a bipartite graph
• Bipartite graphs with even spanning trees
• Title not available (Why is that?)

This page was built for publication: A note on a spanning \((\alpha ,\beta )\)-ended tree in a bipartite graph

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