Instruct: Given the title of a scientific paper, retrieve paper titles that are cited by the given paper
Query: The Hamiltonian Cycle Problem is Linear-Time Solvable for 4-Connected Planar Graphs
The Planar Hamiltonian Circuit Problem is NP-Complete
Unifying Maximum Cut and Minimum Cut of a Planar Graph
Fast Parallel Algorithm for Enumerating All Chordless Cycles in Graphs
LOCALLY PLANAR GRAPHS ARE 5-CHOOSABLE
(4,2)-choosability of planar graphs with forbidden structures
Planar 3-colorability is polynomial complete
Finding Steiner forests in planar graphs
The traveling salesman problem for cubic graphs
Unavoidable cycle lengths in graphs
On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm
Addendum: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
The vulcan game of kal-toh: finding or making triconnected planar subgraphs
An algorithm for the graph crossing number problem
Efficient Enumeration of Chordless Cycles
A subset spanner for Planar graphs,: with application to subset TSP
A Planarity Test via Construction Sequences
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
Improved algorithms for min cut and max flow in undirected planar graphs
Pregel Algorithms for Graph Connectivity Problems with Performance Guarantees
Multiple-source shortest paths in planar graphs
Reducibility Among Combinatorial Problems
Design and Implementation of an Intra-domain routing module for an SDN controller for Traffic Engineering in SDN environment
Energy system contributions in indoor rock climbing
The tower technique and vertical supraperiosteal depot technique: novel vertical injection techniques for volume-efficient subcutaneous tissue support and volumetric augmentation.
Radiation exposure of medical staff from interventional x-ray procedures: a multicentre study