• Journal of applied mathematics & informatics
• /
• 제26권5_6호
• /
• pp.851-860
• /
• 2008

A countable locally finite triangulation is a strong triangulation if a representation of the graph contains no vertex- or edge-accumulation points. In this paper we exhibit the structure of an infinite strong triangulation and prove the existence of connected spanning subgraph with maximum degree 4 in such a graph

• 대한수학회지
• /
• 제30권2호
• /
• pp.275-284
• /
• 1993

• Journal of applied mathematics & informatics
• /
• 제22권1_2호
• /
• pp.577-587
• /
• 2006

We present several properties concerning infinite maximal planar graphs. Results related to the infinite VAP-free planar graphs are also included. Finally, we extend the result of W. Goddard, who showed that every finite 4-connected maximal planar graph is 4-ordered, to infinite strong triangulations.