Connected subgraphs with small degree sums in 3-connected planar graphs

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199903)30:3<191::AID-JGT4>3.0.CO;2-X" /><191::AID-JGT4>3.0.CO;2-X 10.1002/(SICI)1097-0118(199903)30:3<191::AID-JGT4>3.0.CO;2-XzbMath0916.05020OpenAlexW4256465080MaRDI QIDQ4237728

Katsuhiro Ota, Hikoe Enomoto

Publication date: 7 July 1999

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199903)30:3<191::aid-jgt4>3.0.co;2-x

zbMATH Keywords

degree sum3-connected planar graphconnected subgraph3-tree

Mathematics Subject Classification ID

Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (7)

On weights of induced paths and cycles in claw-free andK1,r-free graphs ⋮ Weights of induced subgraphs in \(K_{1,r}\)-free graphs ⋮ Subgraphs of graphs on surfaces with high representativity ⋮ On the existence of specific stars in planar graphs ⋮ Light paths in 4-connected graphs in the plane and other surfaces ⋮ Subgraphs with restricted degrees of their vertices in planar graphs ⋮ Note on weights of paths in polyhedral graphs

Cites Work

• Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
• Trees in Polyhedral Graphs

This page was built for publication: Connected subgraphs with small degree sums in 3-connected planar graphs