Number of vertices of degree three in spanning 3-trees in square graphs

DOI10.1016/J.AMC.2019.03.062MaRDI QIDQ2009592zbMATH OpenOpenAlexFDO

Authors Win Min Aye, Tao Tian, Liming Xiong

Publication date 29 November 2019

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2019.03.062

zbMATH Keywords

spanning treesquare graph3-tree

Mathematics Subject Classification ID

Enumeration in graph theory (05C30)

Recommendations

• Spanning trees with minimum number of leaves in the square graph of a tree
• On the largest tree of given maximum degree in a connected graph
• Spanning trees with many leaves: new lower bounds in terms of the number of vertices of degree 3 and at least 4
• A note on a spanning 3-tree
• scientific article; zbMATH DE number 4008429

Cites work

• A note on a spanning 3-tree
• Graph theory
• Independence trees and Hamilton cycles
• Maximal trees with bounded maximum degree in a graph
• Note on Hamilton Circuits
• On a conjecture of Las Vergnas concerning certain spanning trees in graphs
• On the largest tree of given maximum degree in a connected graph
• Spanning trees with bounded degrees
• Spanning trees with minimum number of leaves in the square graph of a tree
• The square of a connected S(K1,3)-free graph is vertex pancyclic
• The square of every two-connected graph is Hamiltonian

Cited in

(3)

• 3-trees with few vertices of degree 3 in circuit graphs
• Spanning trees with minimum number of leaves in the square graph of a tree
• Trestles in the squares of graphs

This page was built for publication: Number of vertices of degree three in spanning 3-trees in square graphs

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