搜索结果: 1-4 共查到“几何学基础 Graphs”相关记录4条 . 查询时间(0.096 秒)
Almost Series-Parallel graphs: structure and colorability
Series-Parallel graphs structure colorability
2011/2/28
The series-parallel (SP) graphs are those containing no topological K4 and are considered trivial.We relax the prohibition distinguishing the SP graphs by forbidding only embeddings of K4 whose edges ...
Contracting planar graphs to contractions of triangulations
planar graph dual graph contraction topological minor
2011/1/20
For every graph H, there exists a polynomial-time algorithm deciding if a planar input graph G can be contracted to H. However, the degree of the polynomial depends on the size of H. In this paper, we...
Dense graphs with a large triangle cover have a large triangle packing
Dense graphs with large triangle cover large triangle packing
2010/11/29
It is well known that a graph with m edges can be made triangle-free by removing (slightly less
than) m/2 edges. On the other hand, there are many classes of graphs which are hard to make
triangle-f...
Edge Coloring of Triangle-Free 1-Planar Graphs.