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

DOI10.1016/J.AMC.2019.03.062zbMath1428.05138OpenAlexW2939832991MaRDI QIDQ2009592

Tao Tian, Win Min Aye, Limning 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)

Cites Work

• Unnamed Item
• On a conjecture of Las Vergnas concerning certain spanning trees in graphs
• Spanning trees with bounded degrees
• Maximal trees with bounded maximum degree in a graph
• A note on a spanning 3-tree
• The square of every two-connected graph is Hamiltonian
• Note on Hamilton Circuits
• The square of a connected S(K1,3)-free graph is vertex pancyclic
• Independence trees and Hamilton cycles
• 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

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