Degree sums and dominating cycles
From MaRDI portal
Publication:2222926
Recommendations
Cites work
- A note on Hamiltonian circuits
- Existence of dominating cycles and paths
- Hamilton cycles in claw-free graphs
- On Eulerian and Hamiltonian Graphs and Line Graphs
- Relative length of long paths and cycles in graphs with large degree sums
- Relative length of longest paths and cycles in 3-connected graphs
- Relative length of longest paths and cycles in graphs
- Two sufficient conditions for dominating cycles
Cited in
(23)- Weak cycle partition involving degree sum conditions
- A note on dominating cycles in 2-connected graphs
- Subgraph summability number of paths and cycles
- Two sufficient conditions for Hamilton and dominating cycles
- Degree sums and spanning brooms of a graph
- Edge degrees and dominating cycles
- Edge-dominating cycles in graphs
- Degree sum and connectivity conditions for dominating cycles
- Long dominating cycles in graphs
- Two sufficient conditions for dominating cycles
- scientific article; zbMATH DE number 1802820 (Why is no real title available?)
- scientific article; zbMATH DE number 4008435 (Why is no real title available?)
- scientific article; zbMATH DE number 57430 (Why is no real title available?)
- scientific article; zbMATH DE number 4123766 (Why is no real title available?)
- Degree sum and vertex dominating paths
- Degree Sums and Covering Cycles
- Long dominating cycles in graphs
- Degree sums and path-factors in graphs
- Degree sums, connectivity and dominating cycles in graphs
- Degree conditions and relative length of longest paths and cycles in graphs
- Extremal graphs for degree sums and dominating cycles
- A note on a longest cycle which is vertex dominating
- The k-dominating cycles in graphs
This page was built for publication: Degree sums and dominating cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2222926)