Finding short cycles in embedded graph in polynomial time

DOI10.1007/s11464-010-0003-yzbMath1223.05144arXiv0807.1620OpenAlexW1981423913MaRDI QIDQ977665

Ni Cao, Han Ren

Publication date: 23 June 2010

Published in: Frontiers of Mathematics in China (Search for Journal in Brave)

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

zbMATH Keywords

\(\Pi\)-twosided cycleembedded graphbreadth-first-search tree

Mathematics Subject Classification ID

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

Related Items (1)

Finding a shortest cycle in a subspace of the cycle space of a graph

Cites Work

• Embeddings of graphs with no short noncontractible cycles
• Unnamed Item
• Unnamed Item

This page was built for publication: Finding short cycles in embedded graph in polynomial time