2-connected spanning subgraphs of planar 3-connected graphs

DOI10.1006/jctb.1994.1045zbMath0812.05015OpenAlexW1994673335MaRDI QIDQ1333340

D. W. Barnette

Publication date: 20 March 1995

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.1045

zbMATH Keywords

spanning treeplanar graphspanning subgraph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

Related Items (15)

Unnamed Item ⋮ 2-connected spanning subgraphs with low maximum degree in locally planar graphs ⋮ Enumerative properties of rooted circuit maps ⋮ On 2-connected spanning subgraphs with low maximum degree ⋮ Rooted minors and locally spanning subgraphs ⋮ A Dirac theorem for trestles ⋮ Hamiltonicity of graphs on surfaces in terms of toughness and scattering number -- a survey ⋮ Subgraphs of graphs on surfaces with high representativity ⋮ Two local and one global properties of 3-connected graphs on compact 2-dimensional manifolds ⋮ Ortho-polygon visibility representations of 3-connected 1-plane graphs ⋮ Polyline drawings with topological constraints ⋮ Polyline Drawings with Topological Constraints ⋮ On \(3\)-connected plane graphs without triangular faces ⋮ Long cycles in graphs on a fixed surface ⋮ Coloring the faces of convex polyhedra so that like colors are far apart

This page was built for publication: 2-connected spanning subgraphs of planar 3-connected graphs