Subgraphs of 4-Regular Planar Graphs
Algorithmica(2010)
摘要
We shall present an algorithm for determining whether or not a given planar graph H can ever be a subgraph of a 4-regular planar graph. The algorithm has running time O (| H | 2.5 ) and can be used to find an explicit 4-regular planar graph G ⊃ H if such a graph exists. It shall not matter whether we specify that H and G must be simple graphs or allow them to be multigraphs.
更多查看译文
关键词
Planar graphs,Subgraph appearance
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要