Trees in triangulations
From MaRDI portal
Publication:1322007
DOI10.1006/JCTB.1994.1005zbMATH Open0794.05027OpenAlexW2053088237MaRDI QIDQ1322007FDOQ1322007
Authors: Carsten Thomassen 
Publication date: 1 September 1994
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1994.1005
Recommendations
- Trees in Polyhedral Graphs
- Pairs of trees in tree--tree triangulations
- On trees of polygons
- On the representation of triangulation graphs in trees
- scientific article; zbMATH DE number 4115560
- Trees through specified vertices
- Plane trivalent trees and their patterns
- Trees on hyperbolic lattices
- Tree width and regular triangulations
- 3-trees in polyhedral maps
Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38)
Cited In (29)
- Disjoint paths, planarizing cycles, and spanning walks
- The number of defective colorings of graphs on surfaces
- Toroidal grid minors and stretch in embedded graphs
- Chords of longest circuits in locally planar graphs
- A note on traversing specified vertices in graphs embedded with large representativity
- Title not available (Why is that?)
- 2-connected spanning subgraphs with low maximum degree in locally planar graphs
- Spanning trees: A survey
- Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs
- Corners in tree-like tableaux
- On spanning trees and walks of low maximum degree
- Every 5-connected planar triangulation is 4-ordered Hamiltonian
- On 2-connected spanning subgraphs with low maximum degree
- 2- and 3-factors of graphs on surfaces
- Long cycles in graphs on a fixed surface
- A theorem on paths in locally planar triangulations
- Trees with Convex Faces and Optimal Angles
- Voronoi drawings of trees
- Trees, dendrites and the Cannon-Thurston map
- 3-trees with few vertices of degree 3 in circuit graphs
- Face-width of embedded graphs
- What is on his mind?
- Subgraphs of graphs on surfaces with high representativity
- Title not available (Why is that?)
- On certain spanning subgraphs of embeddings with applications to domination
- Spanning Eulerian subgraphs of bounded degree in triangulations
- Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey
- Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs
- Hamilton cycles in 4-connected troidal triangulations
This page was built for publication: Trees in triangulations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1322007)
