\([2,3]\)-factors in a 3-connected infinite planar graph.

DOI10.1007/BF02936203zbMath1039.05025OpenAlexW2008523834MaRDI QIDQ1847585

Hwan-Ok Jung

Publication date: 2002

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02936203

zbMATH Keywords

spanning subgraphsinfinite graphs

Mathematics Subject Classification ID

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

Related Items (1)

Structural properties for certain classes of infinite planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Connected spanning subgraphs of 3-connected planar graphs
• Planarity and duality of finite and infinite graphs
• 2-walks in circuit graphs
• One-way infinite Hamiltonian paths in infinite maximal planar graphs
• 2‐connected coverings of bounded degree in 3‐connected graphs
• Trees in Polyhedral Graphs

This page was built for publication: \([2,3]\)-factors in a 3-connected infinite planar graph.