共查询到8条相似文献,搜索用时 0 毫秒
1.
《Discrete Mathematics》2023,346(5):113322
The 3-polytopes are planar, 3-connected graphs. A classical question is, given , is the -gonal prism the unique 3-polytope of graph radius r and smallest size? Under some extra assumptions, we answer this question in the positive. 相似文献
2.
3.
4.
5.
6.
7.
Ioan Tomescu 《Journal of Graph Theory》2003,43(3):210-222
In the set of graphs of order n and chromatic number k the following partial order relation is defined. One says that a graph G is less than a graph H if ci(G) ≤ ci(H) holds for every i, k ≤ i ≤ n and at least one inequality is strict, where ci(G) denotes the number of i‐color partitions of G. In this paper the first ? n/2 ? levels of the diagram of the partially ordered set of connected 3‐chromatic graphs of order n are described. © 2003 Wiley Periodicals, Inc. J Graph Theory 43: 210–222, 2003 相似文献
8.
Nowhere-zero 3-flows in Cayley graphs on generalized dihedral group and generalized quaternion group
Tutte conjectured that every 4-edge-connected graph admits a nowhere-zero 3-flow. In this paper, we show that this conjecture is true for Cayley graph on generalized dihedral groups and generalized quaternion groups, which generalizes the result of F. Yang and X. Li [Inform. Process. Lett., 2011, 111: 416–419]. We also generalizes an early result of M. Nánásiová and M. ?koviera [J. Algebraic Combin., 2009, 30: 103–110]. 相似文献