Pages that link to "Item:Q977665"
From MaRDI portal
The following pages link to Finding short cycles in embedded graph in polynomial time (Q977665):
Displaying 7 items.
- Finding a shortest cycle in a subspace of the cycle space of a graph (Q668125) (← links)
- Short cycle structures for graphs on surfaces and an open problem of Mohar and Thomassen (Q854646) (← links)
- A note on finding a shortest complete cycle in an undirected graph (Q1069451) (← links)
- Finding even cycles faster via capped k-walks (Q4977965) (← links)
- (Q5389994) (← links)
- Algorithms – ESA 2005 (Q5475826) (← links)
- Finding a shortest even hole in polynomial time (Q6057650) (← links)