Recommendations
- Degree sums, connectivity and dominating cycles in graphs
- Degree sum and vertex dominating paths
- Degree sums and path-factors in graphs
- Degree sums and proper connection number of graphs
- Degree sums and dominating cycles
- On degree sums of a triangle-free graph
- Degree sum and Hamiltonian-connected line graphs
- On the sum of powers of the degrees of graphs
- Degree sums for edges and cycle lengths in graphs
- Degree sums and subpancyclicity in line graphs
Cites work
- A note on Hamiltonian circuits
- Degree conditions for spanning brooms
- Hamilton connected graphs
- scientific article; zbMATH DE number 2038756 (Why is no real title available?)
- scientific article; zbMATH DE number 2086635 (Why is no real title available?)
- scientific article; zbMATH DE number 837058 (Why is no real title available?)
- Neighborhood unions and extremal spanning trees
- Note on Hamilton Circuits
- On a conjecture of Bondy
- On maximal paths and circuits of graphs
- Relative length of long paths and cycles in graphs with large degree sums
- Spanning spiders and light-splitting switches
- Spanning trees: A survey
- The binding number of a graph and its Anderson number
Cited in
(4)
This page was built for publication: Degree sums and spanning brooms of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2144512)
