The following pages link to Frank Göring (Q532659):
Displaying 27 items.
- Learning of winning strategies for terminal games with linear-size memory (Q532661) (← links)
- Graph realizations associated with minimizing the maximum eigenvalue of the Laplacian (Q662288) (← links)
- Unique-maximum coloring of plane graphs (Q907833) (← links)
- (Q968419) (redirect page) (← links)
- Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs (Q968420) (← links)
- Random procedures for dominating sets in graphs (Q986706) (← links)
- Short proof of Menger's theorem (Q1567687) (← links)
- On 2-regular subgraphs in polyhedral graphs (Q1613472) (← links)
- On short cycles through prescribed vertices of a graph (Q1883253) (← links)
- Local topological toughness and local factors (Q2385135) (← links)
- Prescribed edges and forbidden edges for a cycle in a planar graph (Q2446300) (← links)
- On cycles through specified vertices (Q2495522) (← links)
- Menger's Theorem (Q2725048) (← links)
- On Minimizing the Spectral Width of Graph Laplacians and Associated Graph Realizations (Q2848176) (← links)
- Locally Dense Independent Sets in Regular Graphs of Large Girth—An Example of a New Approach (Q2971608) (← links)
- GreedyMAX-type Algorithms for the Maximum Independent Set Problem (Q3075512) (← links)
- The rotational dimension of a graph (Q3168659) (← links)
- The rotational Dimension of a graph (Q3439518) (← links)
- On F-independence in graphs (Q3559385) (← links)
- (Q3576696) (← links)
- Embedded in the Shadow of the Separator (Q3608992) (← links)
- The potential of greed for independence (Q4650180) (← links)
- A proof of Menger's Theorem by contraction (Q4786792) (← links)
- On Domination in Graphs (Q5316253) (← links)
- The edge-transitive polytopes that are not vertex-transitive (Q5871590) (← links)
- Uniformly connected graphs (Q6081585) (← links)
- The Edge-transitive Polytopes that are not Vertex-transitive (Q6341649) (← links)
