Find subtrees of specified weight and cycles of specified length in linear time

DOI10.1002/JGT.22712zbMath1522.05241arXiv1902.06484OpenAlexW3199315121MaRDI QIDQ6056757

On-Hei S. Lo

Publication date: 4 October 2023

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1902.06484

zbMATH Keywords

cycles in planar Hamiltonian graphssubtree sums

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Eulerian and Hamiltonian graphs (05C45)

Related Items (3)

Cycles in 3-connected claw-free planar graphs and 4-connected planar graphs without 4-cycles ⋮ Cycle spectra of contraction-critically 4-connected planar graphs ⋮ Distribution of subtree sums

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding and counting given length cycles
• Planar graphs without cycles of specific lengths
• Finding large cycles in Hamiltonian graphs
• Long cycles in 4-connected planar graphs
• A linear algorithm for embedding planar graphs using PQ-trees
• Some 4-valent, 3-connected, planar, almost pancyclic graphs
• 4-connected projective planar graphs are Hamiltonian
• Choosability and edge choosability of planar graphs without five cycles
• Cycles in 4-connected planar graphs
• On planar graphs arbitrarily decomposable into closed trails
• The hamiltonian cycle problem is linear-time solvable for 4-connected planar graphs
• A Theorem on Planar Graphs
• Color-coding
• On Hamilton cycles in certain planar graphs
• A theorem on paths in planar graphs

This page was built for publication: Find subtrees of specified weight and cycles of specified length in linear time