Pages that link to "Item:Q2162505"
From MaRDI portal
The following pages link to Zero-sum copies of spanning forests in zero-sum complete graphs (Q2162505):
Displaying 11 items.
- A simpler proof and a generalization of the zero-trees theorem (Q1180556) (← links)
- Zero-sum \(K_m\) over \(\mathbb{Z}\) and the story of \(K_4\) (Q2000579) (← links)
- On zero-sum spanning trees and zero-sum connectivity (Q2073300) (← links)
- Forbidding multiple copies of forestable graphs (Q2175780) (← links)
- \(\{0, 2 \}\)-degree free spanning forests in graphs (Q2339439) (← links)
- Efficiently finding low-sum copies of spanning forests in zero-sum complete graphs via conditional expectation (Q2685699) (← links)
- Unbalanced spanning subgraphs in edge labeled complete graphs (Q2692172) (← links)
- Zero‐sum block designs and graph labelings (Q4373384) (← links)
- On zero-sum and almost zero-sum subgraphs over \(\mathbb Z\) (Q5964974) (← links)
- Vertex degrees close to the average degree (Q6080552) (← links)
- Degree conditions on copies of forests in graphs (Q6093997) (← links)
