Non-self-touching paths in plane graphs
A path in a graph G is called non-self-touching if two vertices are neighbours in the path if and only if they are neighbours in the graph. We investigate the existence of doubly infinite non-self-touching paths in infinite plane graphs.The matching graph G_{*} of an infinite plane graph G is obtain...
Saved in:
Published in | Annales de l'Institut Henri Poincaré. D. Combinatorics, physics and their interactions |
---|---|
Main Author | |
Format | Journal Article |
Language | English |
Published |
06.08.2025
|
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!