Trees in triangulations
From MaRDI portal
Publication:1322007
DOI10.1006/jctb.1994.1005zbMath0794.05027OpenAlexW2053088237MaRDI QIDQ1322007
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
Trees (05C05) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)
Related Items
Spanning Eulerian subgraphs of bounded degree in triangulations ⋮ A theorem on paths in locally planar triangulations ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The number of defective colorings of graphs on surfaces ⋮ Every 5-connected planar triangulation is 4-ordered Hamiltonian ⋮ Chords of longest circuits in locally planar graphs ⋮ 2-connected spanning subgraphs with low maximum degree in locally planar graphs ⋮ On 2-connected spanning subgraphs with low maximum degree ⋮ Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey ⋮ Subgraphs of graphs on surfaces with high representativity ⋮ Spanning trees: A survey ⋮ Unnamed Item ⋮ What is on his mind? ⋮ A note on traversing specified vertices in graphs embedded with large representativity ⋮ Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs ⋮ 2- and 3-factors of graphs on surfaces ⋮ Toroidal grid minors and stretch in embedded graphs ⋮ 3-trees with few vertices of degree 3 in circuit graphs ⋮ On certain spanning subgraphs of embeddings with applications to domination ⋮ Spanning trees in 3-connected K3,t-minor-free graphs ⋮ Disjoint paths, planarizing cycles, and spanning walks ⋮ Long cycles in graphs on a fixed surface
