The following pages link to Trees in Polyhedral Graphs (Q5516076):
Displaying 50 items.
- Greedy routing via embedding graphs onto semi-metric spaces (Q388089) (← links)
- Spanning closed walks and TSP in 3-connected planar graphs (Q462924) (← links)
- A lower bound on the diameter of the flip graph (Q521362) (← links)
- WORM colorings of planar graphs (Q521753) (← links)
- Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs (Q536646) (← links)
- Some results on greedy embeddings in metric spaces (Q603850) (← links)
- Enumerative properties of rooted circuit maps (Q604989) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Two local and one global properties of 3-connected graphs on compact 2-dimensional manifolds (Q707019) (← links)
- Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs (Q713980) (← links)
- The number of cycles in 2-factors of cubic graphs (Q804602) (← links)
- Untangling polygons and graphs (Q848672) (← links)
- Graphs of polyhedra; polyhedra as graphs (Q864132) (← links)
- 2-connected spanning subgraphs with low maximum degree in locally planar graphs (Q875943) (← links)
- Decomposing plane cubic graphs (Q896062) (← links)
- 3-trees with few vertices of degree 3 in circuit graphs (Q1011698) (← links)
- Longest cycles in 3-connected cubic graphs (Q1074598) (← links)
- Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen (Q1218870) (← links)
- The spectral radius of a planar graph (Q1260973) (← links)
- Spanning Eulerian subgraphs of bounded degree in triangulations (Q1334938) (← links)
- Subgraphs of graphs on surfaces with high representativity (Q1417964) (← links)
- Structural properties for certain classes of infinite planar graphs (Q1429336) (← links)
- On \(3\)-connected plane graphs without triangular faces (Q1569046) (← links)
- Optimal vertex ordering of graphs (Q1607014) (← links)
- Circumference of 3-connected cubic graphs (Q1682212) (← links)
- Proper orientations of planar bipartite graphs (Q1684937) (← links)
- Facial packing vertex-coloring of subdivided plane graphs (Q1730225) (← links)
- 3-trees in polyhedral maps (Q1802763) (← links)
- \([2,3]\)-factors in a 3-connected infinite planar graph. (Q1847585) (← links)
- Long cycles in graphs on a fixed surface (Q1850617) (← links)
- Long cycles in 3-connected graphs (Q1850624) (← links)
- On the Hamiltonian property hierarchy of 3-connected planar graphs (Q2094888) (← links)
- A counterexample to prism-Hamiltonicity of 3-connected planar graphs (Q2221929) (← links)
- On planar greedy drawings of 3-connected planar graphs (Q2283114) (← links)
- Facial anagram-free edge-coloring of plane graphs (Q2399301) (← links)
- Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees (Q2403697) (← links)
- Hamiltonian circuits in certain prisms (Q2563171) (← links)
- A zero-free interval for chromatic polynomials of graphs with 3-leaf spanning trees (Q2629280) (← links)
- Dual circumference and collinear sets (Q2679595) (← links)
- Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey (Q2695475) (← links)
- (Q2702745) (← links)
- (Q2707974) (← links)
- Spanning trees in 3-connected K3,t-minor-free graphs (Q2851454) (← links)
- Greedy Routing via Embedding Graphs onto Semi-metric Spaces (Q3004656) (← links)
- Facial non-repetitive edge-coloring of plane graphs (Q3067060) (← links)
- The number of defective colorings of graphs on surfaces (Q3174242) (← links)
- Connectivity Oracles for Graphs Subject to Vertex Failures (Q3387763) (← links)
- Hamiltonicity and pancyclicity of generalized prisms (Q3439413) (← links)
- Connected subgraphs with small degree sums in 3-connected planar graphs (Q4237728) (← links)
- Improving upper bounds for the distinguishing index (Q4604514) (← links)
