Trees in Polyhedral Graphs
From MaRDI portal
Publication:5516076
DOI10.4153/CJM-1966-073-4zbMath0141.21401MaRDI QIDQ5516076
Publication date: 1966
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Related Items (61)
Spanning Eulerian subgraphs of bounded degree in triangulations ⋮ A survey on edge reconstruction of graphs ⋮ Unnamed Item ⋮ A zero-free interval for chromatic polynomials of graphs with 3-leaf spanning trees ⋮ Unnamed Item ⋮ The number of defective colorings of graphs on surfaces ⋮ Untangling polygons and graphs ⋮ Graphs of polyhedra; polyhedra as graphs ⋮ Polytopes, graphs, and complexes ⋮ Facial anagram-free edge-coloring of plane graphs ⋮ Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees ⋮ 2-connected spanning subgraphs with low maximum degree in locally planar graphs ⋮ Some results on greedy embeddings in metric spaces ⋮ Enumerative properties of rooted circuit maps ⋮ Greedy routing via embedding graphs onto semi-metric spaces ⋮ Circumference of 3-connected cubic graphs ⋮ Proper orientations of planar bipartite graphs ⋮ Dual circumference and collinear sets ⋮ Decomposing plane cubic graphs ⋮ 2‐connected coverings of bounded degree in 3‐connected graphs ⋮ Rooted minors and locally spanning subgraphs ⋮ Improving upper bounds for the distinguishing index ⋮ Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey ⋮ Subgraphs of graphs on surfaces with high representativity ⋮ Spanning closed walks and TSP in 3-connected planar graphs ⋮ Structural properties for certain classes of infinite planar graphs ⋮ A counterexample to prism-Hamiltonicity of 3-connected planar graphs ⋮ Spanning trees: A survey ⋮ Facial packing vertex-coloring of subdivided plane graphs ⋮ Greedy Routing via Embedding Graphs onto Semi-metric Spaces ⋮ A lower bound on the diameter of the flip graph ⋮ WORM colorings of planar graphs ⋮ Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs ⋮ Untangling polygons and graphs ⋮ Existenz von Gerüsten mit vorgeschriebenem Maximalgrad in Graphen ⋮ Two local and one global properties of 3-connected graphs on compact 2-dimensional manifolds ⋮ Hamilton cycles in prisms ⋮ Spanning trees in 3-connected \(K_{3,t}\)-minor-free graphs ⋮ Connected subgraphs with small degree sums in 3-connected planar graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On planar greedy drawings of 3-connected planar graphs ⋮ Prism‐hamiltonicity of triangulations ⋮ Facial non-repetitive edge-coloring of plane graphs ⋮ 3-trees in polyhedral maps ⋮ 3-trees with few vertices of degree 3 in circuit graphs ⋮ The spectral radius of a planar graph ⋮ Types of triangle in Hamiltonian triangulations and an application to domination and k-walks ⋮ Connectivity Oracles for Graphs Subject to Vertex Failures ⋮ On \(3\)-connected plane graphs without triangular faces ⋮ Hamiltonian circuits in certain prisms ⋮ Spanning trees in 3-connected K3,t-minor-free graphs ⋮ \([2,3\)-factors in a 3-connected infinite planar graph.] ⋮ On the Hamiltonian property hierarchy of 3-connected planar graphs ⋮ Long cycles in graphs on a fixed surface ⋮ Long cycles in 3-connected graphs ⋮ Unnamed Item ⋮ Hamiltonicity and pancyclicity of generalized prisms ⋮ The number of cycles in 2-factors of cubic graphs ⋮ Optimal vertex ordering of graphs ⋮ Longest cycles in 3-connected cubic graphs
This page was built for publication: Trees in Polyhedral Graphs
