Light paths in 4-connected graphs in the plane and other surfaces

DOI<link itemprop=identifier href="https://doi.org/10.1002/1097-0118(200006)34:2<170::AID-JGT6>3.0.CO;2-P" /><170::AID-JGT6>3.0.CO;2-P 10.1002/1097-0118(200006)34:2<170::AID-JGT6>3.0.CO;2-PzbMath0946.05034OpenAlexW4232523080MaRDI QIDQ4489492

Bojan Mohar

Publication date: 18 October 2000

Full work available at URL: https://doi.org/10.1002/1097-0118(200006)34:2<170::aid-jgt6>3.0.co;2-p

zbMATH Keywords

embedded graphs3-connected planar graphslight paths

Mathematics Subject Classification ID

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

Related Items (10)

On the Decay of Crossing Numbers of Sparse Graphs ⋮ Light graphs in families of outerplanar graphs ⋮ On the structure of essentially-highly-connected polyhedral graphs ⋮ On weights of induced paths and cycles in claw-free andK1,r-free graphs ⋮ Lightweight paths in 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 subgraphs of order at most 3 in large maps of minimum degree 5 on compact 2-manifolds ⋮ Every triangulated 3-polytope of minimum degree 4 has a 4-path of weight at most 27

Cites Work

• Extending Kotzig's theorem
• On light cycles in plane triangulations
• Subgraphs with restricted degrees of their vertices in planar 3-connected graphs
• A structural property of convex 3-polytopes
• On \(3\)-connected plane graphs without triangular faces
• Subgraphs with restricted degrees of their vertices in planar graphs
• Disjoint paths, planarizing cycles, and spanning walks
• Connected subgraphs with small degree sums in 3-connected planar graphs
• Paths with restricted degrees of their vertices in planar graphs

This page was built for publication: Light paths in 4-connected graphs in the plane and other surfaces