Distribution of subtree sums
From MaRDI portal
Publication:2107487
DOI10.1016/J.EJC.2022.103615zbMath1504.05152OpenAlexW4306399898MaRDI QIDQ2107487
Publication date: 1 December 2022
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejc.2022.103615
Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Signed and weighted graphs (05C22)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Planar graphs without cycles of specific lengths
- Long cycles in 4-connected planar graphs
- 4-connected projective planar graphs are Hamiltonian
- Choosability and edge choosability of planar graphs without five cycles
- Cycles in 4-connected planar graphs
- A Theorem on Planar Graphs
- On Hamilton cycles in certain planar graphs
- A theorem on paths in planar graphs
- Find subtrees of specified weight and cycles of specified length in linear time
This page was built for publication: Distribution of subtree sums