Trees in Polyhedral Graphs
From MaRDI portal
Cited in
(74)- 3-trees with few vertices of degree 3 in circuit graphs
- Longest cycles in 3-connected cubic graphs
- Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen
- The spectral radius of a planar graph
- Geometric tree graphs of points in convex position
- Trees in triangulations
- Tree polytope on 2-trees
- Spanning Eulerian subgraphs of bounded degree in triangulations
- Subgraphs of graphs on surfaces with high representativity
- Structural properties for certain classes of infinite planar graphs
- On \(3\)-connected plane graphs without triangular faces
- Optimal vertex ordering of graphs
- Circumference of 3-connected cubic graphs
- Proper orientations of planar bipartite graphs
- Facial packing vertex-coloring of subdivided plane graphs
- 3-trees in polyhedral maps
- \([2,3]\)-factors in a 3-connected infinite planar graph.
- Long cycles in graphs on a fixed surface
- Long cycles in 3-connected graphs
- On the Hamiltonian property hierarchy of 3-connected planar graphs
- A counterexample to prism-Hamiltonicity of 3-connected planar graphs
- On planar greedy drawings of 3-connected planar graphs
- Facial anagram-free edge-coloring of plane graphs
- Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees
- Hamiltonian circuits in certain prisms
- A zero-free interval for chromatic polynomials of graphs with 3-leaf spanning trees
- Dual circumference and collinear sets
- Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey
- Face-width of embedded graphs
- On spanning trees and walks of low maximum degree
- The tree graph identity and the polymer expansion
- Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs
- Greedy Routing via Embedding Graphs onto Semi-metric Spaces
- Facial non-repetitive edge-coloring of plane graphs
- Structure Polynomials and Subgraphs of Rooted Regular Trees
- The number of defective colorings of graphs on surfaces
- Connectivity oracles for graphs subject to vertex failures
- Hamiltonicity and pancyclicity of generalized prisms
- Greedy routing via embedding graphs onto semi-metric spaces
- Connected subgraphs with small degree sums in 3-connected planar graphs
- Treetopes and their Graphs
- Improving upper bounds for the distinguishing index
- Spanning closed walks and TSP in 3-connected planar graphs
- A survey on edge reconstruction of graphs
- 2‐connected coverings of bounded degree in 3‐connected graphs
- Trees, ladders and graphs
- Dual circumference and collinear sets
- Finding Tutte paths in linear time
- A lower bound on the diameter of the flip graph
- Types of triangle in Hamiltonian triangulations and an application to domination and \(k\)-walks
- WORM colorings of planar graphs
- Untangling polygons and graphs
- Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs
- scientific article; zbMATH DE number 6277690 (Why is no real title available?)
- Hamilton cycles in prisms
- Prism‐hamiltonicity of triangulations
- Polytopes, graphs, and complexes
- Spanning closed walks and TSP in 3-connected planar graphs
- Some results on greedy embeddings in metric spaces
- Enumerative properties of rooted circuit maps
- Rooted minors and locally spanning subgraphs
- Spanning trees: A survey
- Strongly proper connected coloring of graphs
- 2-connected spanning subgraphs of circuit graphs
- Toward Grünbaum's conjecture
- Toward Grünbaum's conjecture bounding vertices of degree 4
- Two local and one global properties of 3-connected graphs on compact 2-dimensional manifolds
- Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs
- Toward Grünbaum's conjecture for 4-connected graphs
- The number of cycles in 2-factors of cubic graphs
- Untangling polygons and graphs
- Graphs of polyhedra; polyhedra as graphs
- 2-connected spanning subgraphs with low maximum degree in locally planar graphs
- Decomposing plane cubic graphs
This page was built for publication: Trees in Polyhedral Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5516076)
