Spanning trees without adjacent vertices of degree 2
From MaRDI portal
Publication:2329190
DOI10.1016/j.disc.2019.111604zbMath1422.05033arXiv1801.07025OpenAlexW2964458928WikidataQ127402696 ScholiaQ127402696MaRDI QIDQ2329190
Kasper Szabo Lyngsie, Martin Merker
Publication date: 17 October 2019
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.07025
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Forbidden subgraphs and the existence of a spanning tree without small degree stems
- Homeomorphically irreducible spanning trees
- Exact algorithms for \(L(2,1)\)-labeling of graphs
- The number of homeomorphically irreducible trees, and other species
- Non-separating induced cycles in graphs
- Star-factors in graphs with large minimum degree
- A characterization of \(P_5\)-free graphs with a homeomorphically irreducible spanning tree
- HISTs of triangulations on surfaces
- Homeomorphically Irreducible Spanning Trees in Locally Connected Graphs
- High degree graphs contain large-star factors
- On homeomorphically irreducible spanning trees in cubic graphs
- Graphs with homeomorphically irreducible spanning trees
This page was built for publication: Spanning trees without adjacent vertices of degree 2