The following pages link to A Theorem on Planar Graphs (Q3231816):
Displaying 50 items.
- Two-page book embeddings of 4-planar graphs (Q300468) (← links)
- Every 5-connected planar triangulation is 4-ordered Hamiltonian (Q307916) (← links)
- Dominating plane triangulations (Q335349) (← links)
- Intersecting longest paths (Q389499) (← links)
- Dynamic graph-based search in unknown environments (Q414464) (← links)
- Spanning closed walks and TSP in 3-connected planar graphs (Q462924) (← links)
- Domination of maximal \(K_4\)-minor free graphs and maximal \(K_{2, 3}\)-minor free graphs, and disproofs of two conjectures on planar graphs (Q494435) (← links)
- Spanning trees with nonseparating paths (Q501078) (← links)
- Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs (Q536646) (← links)
- Guthrie's problem: new equivalences and rapid reductions (Q672855) (← links)
- Extending matchings in planar graphs. IV (Q686303) (← links)
- On existence theorems (Q686508) (← links)
- What is on his mind? (Q709300) (← links)
- A note on traversing specified vertices in graphs embedded with large representativity (Q709309) (← links)
- Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs (Q713980) (← links)
- Hamiltonian properties of polyhedra with few 3-cuts. A survey (Q724894) (← links)
- A new proof that 4-connected planar graphs are Hamiltonian-connected (Q726634) (← links)
- Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27 (Q727044) (← links)
- A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs (Q788489) (← links)
- Hamiltonian cycles in cubic 3-connected bipartite planar graphs (Q801087) (← links)
- The number of cycles in 2-factors of cubic graphs (Q804602) (← links)
- Greedy drawings of triangulations (Q848683) (← links)
- Chords of longest circuits in locally planar graphs (Q854834) (← links)
- The circumference of a graph with no \(K_{3,t}\)-minor (Q859611) (← links)
- Hamiltonicity and colorings of arrangement graphs (Q860408) (← links)
- 2-connected spanning subgraphs with low maximum degree in locally planar graphs (Q875943) (← links)
- Bounding tree-width via contraction on the projective plane and torus (Q888611) (← links)
- Relationship among triangulations, quadrangulations and optimal 1-planar graphs (Q897254) (← links)
- The matching extendability of surfaces (Q918993) (← links)
- On the obfuscation complexity of planar graphs (Q924163) (← links)
- Flips in planar graphs (Q950400) (← links)
- Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs (Q968420) (← links)
- A note on 3-connected cubic planar graphs (Q973135) (← links)
- Matching points with squares (Q1006403) (← links)
- 3-trees with few vertices of degree 3 in circuit graphs (Q1011698) (← links)
- Long cycles in 4-connected planar graphs (Q1011776) (← links)
- Maximum bipartite subgraphs of cubic triangle-free planar graphs (Q1011782) (← links)
- A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs (Q1044928) (← links)
- Hamiltonicity in vertex envelopes of plane cubic graphs (Q1044951) (← links)
- A survey of the asymptotic behaviour of maps (Q1057284) (← links)
- Longest cycles in 3-connected cubic graphs (Q1074598) (← links)
- A unified approach to visibility representations of planar graphs (Q1085167) (← links)
- Random triangulations of the plane (Q1114717) (← links)
- Pairs of edge disjoint Hamiltonian circuits in 5-connected planar graphs (Q1124606) (← links)
- On 2-connected spanning subgraphs with low maximum degree (Q1127880) (← links)
- Interval matroids and graphs (Q1134768) (← links)
- Lower bounds on the cardinality of the maximum matchings of planar graphs (Q1135291) (← links)
- On regular graphs and Hamiltonian circuits, including answers to some questions of Joseph Zaks (Q1141659) (← links)
- Edge-disjoint Hamilton cycles in 4-regular planar graphs (Q1153926) (← links)
- The smallest 2-connected cubic bipartite planar nonhamiltonian graph (Q1158439) (← links)
